n, a, b = map(int, input().split())
MOD = 10**9+7

len_inv = 2*(10**5) + 10
inv = [1]*(len_inv)

for i in range(2, len_inv):
    inv[i] = inv[MOD%i] * (MOD - MOD//i) % MOD

def comb(n, k, MOD):
    x = 1
    for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
    return x

ans = pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD)
ans += MOD
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 len_inv = 2*(10**5) + 10 len_inv 2*(10**5) + 10 2*(10**5) 2 10**5 10 5 10 inv = [1]*(len_inv) inv [1]*(len_inv) [1] 1 len_inv for i in range(2, len_inv):
    inv[i] = inv[MOD%i] * (MOD - MOD//i) % MOD i range(2, len_inv) range 2 len_inv inv[i] = inv[MOD%i] * (MOD - MOD//i) % MOD inv[i] inv i inv[MOD%i] * (MOD - MOD//i) % MOD inv[MOD%i] * (MOD - MOD//i) inv[MOD%i] inv MOD%i MOD i MOD - MOD//i MOD MOD//i MOD i MOD def comb(n, k, MOD):
    x = 1
    for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
    return x comb x = 1 x 1 for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
     i range(k) range k x *= (n-i) x n-i n i x *= inv[i+1] x inv[i+1] inv i+1 i 1 x %= MOD x MOD return x x n n k k MOD MOD ans = pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD) ans pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD) pow(2, n, MOD) - 1 - comb(n, a, MOD) pow(2, n, MOD) - 1 pow(2, n, MOD) pow 2 n MOD 1 comb(n, a, MOD) comb n a MOD comb(n, b, MOD) comb n b MOD ans += MOD ans MOD ans %= MOD ans MOD print(ans) print ans b = map(int, input().split()) map(int, input().split()) b MOD = 10**9+7 10**9+7 MOD n, a, b = map(int, input().split()) map(int, input().split()) n len_inv = 2*(10**5) + 10 2*(10**5) + 10 len_inv inv = [1]*(len_inv) [1]*(len_inv) inv def comb(n, k, MOD):
    x = 1
    for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
    return x def comb(n, k, MOD):
    x = 1
    for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
    return x comb ans %= MOD MOD ans a, b = map(int, input().split()) map(int, input().split()) a ans += MOD MOD ans ans = pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD) pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD) ans
n, a, b = map(int, input().split())
MOD = 10**9+7

len_inv = 2*(10**5) + 10
inv = [1]*(len_inv)

for i in range(2, len_inv):
    inv[i] = inv[MOD%i] * (MOD - MOD//i) % MOD

def comb(n, k, MOD):
    x = 1
    for i in range(k):
        x *= (n-i)
        x *= inv[i+1]
        x %= MOD
    return x

ans = pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD)
ans += MOD
ans %= MOD
print(ans)