n, a, b = map(int, input().split())
mod = 10**9+7
ans = pow(2, n, mod)-1

nCa = 1
nCb = 1
for i in range(b):
    nCb *= (n-i)
    nCb %= mod
    nCb *= pow(i+1, mod-2, mod)
    if i == a-1:
        nCa = nCb
ans -= nCa
ans %= mod
ans -= nCb
ans %= mod

print(ans) n, a, b = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split a b mod = 10**9+7 mod 10**9+7 10**9 10 9 7 ans = pow(2, n, mod)-1 ans pow(2, n, mod)-1 pow(2, n, mod) pow 2 n mod 1 nCa = 1 nCa 1 nCb = 1 nCb 1 for i in range(b):
    nCb *= (n-i)
    nCb %= mod
    nCb *= pow(i+1, mod-2, mod)
    if i == a-1:
        nCa = nCb i range(b) range b nCb *= (n-i) nCb n-i n i nCb %= mod nCb mod nCb *= pow(i+1, mod-2, mod) nCb pow(i+1, mod-2, mod) pow i+1 i 1 mod-2 mod 2 mod if i == a-1:
        nCa = nCb i == a-1 i a-1 a 1 nCa = nCb nCa nCb ans -= nCa ans nCa ans %= mod ans mod ans -= nCb ans nCb ans %= mod ans mod print(ans) print ans b = map(int, input().split()) map(int, input().split()) b ans -= nCb nCb ans nCb *= (n-i) n-i nCb nCb = 1 1 nCb ans %= mod mod ans a, b = map(int, input().split()) map(int, input().split()) a nCa = 1 1 nCa nCb *= pow(i+1, mod-2, mod) pow(i+1, mod-2, mod) nCb ans = pow(2, n, mod)-1 pow(2, n, mod)-1 ans ans -= nCa nCa ans nCa = nCb nCb nCa n, a, b = map(int, input().split()) map(int, input().split()) n mod = 10**9+7 10**9+7 mod nCb %= mod mod nCb ans %= mod mod ans
n, a, b = map(int, input().split())
mod = 10**9+7
ans = pow(2, n, mod)-1

nCa = 1
nCb = 1
for i in range(b):
    nCb *= (n-i)
    nCb %= mod
    nCb *= pow(i+1, mod-2, mod)
    if i == a-1:
        nCa = nCb
ans -= nCa
ans %= mod
ans -= nCb
ans %= mod

print(ans)