
N, A, B = map(int, input().split())

MAX = 2 * 10 ** 5 + 1
MOD = 10 ** 9 + 7

# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1

# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1

# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1

for i in range(2, MAX + 1):
    fac[i] = fac[i - 1] * i % MOD
    inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
    finv[i] = finv[i - 1] * inv[i] % MOD

# Factorial for large
facl = [0] * (MAX + 1)
facl[0] = N
for i in range(1, MAX + 1):
    facl[i] = facl[i - 1] * (N - i) % MOD

# Solution
ans = pow(2, N, MOD) - 1
ans -= facl[A - 1] * finv[A] % MOD
ans %= MOD
ans -= facl[B - 1] * finv[B] % 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 MAX = 2 * 10 ** 5 + 1 MAX 2 * 10 ** 5 + 1 2 * 10 ** 5 2 10 ** 5 10 5 1 MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 fac = [0] * (MAX + 1) fac [0] * (MAX + 1) [0] 0 MAX + 1 MAX 1 fac[0] = 1 fac[0] fac 0 1 fac[1] = 1 fac[1] fac 1 1 inv = [0] * (MAX + 1) inv [0] * (MAX + 1) [0] 0 MAX + 1 MAX 1 inv[1] = 1 inv[1] inv 1 1 finv = [0] * (MAX + 1) finv [0] * (MAX + 1) [0] 0 MAX + 1 MAX 1 finv[0] = 1 finv[0] finv 0 1 finv[1] = 1 finv[1] finv 1 1 for i in range(2, MAX + 1):
    fac[i] = fac[i - 1] * i % MOD
    inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
    finv[i] = finv[i - 1] * inv[i] % MOD

# Factorial for large i range(2, MAX + 1) range 2 MAX + 1 MAX 1 fac[i] = fac[i - 1] * i % MOD fac[i] fac i fac[i - 1] * i % MOD fac[i - 1] * i fac[i - 1] fac i - 1 i 1 i MOD inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD inv[i] inv i MOD - inv[MOD % i] * (MOD // i) % MOD MOD inv[MOD % i] * (MOD // i) % MOD inv[MOD % i] * (MOD // i) inv[MOD % i] inv MOD % i MOD i MOD // i MOD i MOD finv[i] = finv[i - 1] * inv[i] % MOD finv[i] finv i finv[i - 1] * inv[i] % MOD finv[i - 1] * inv[i] finv[i - 1] finv i - 1 i 1 inv[i] inv i MOD facl = [0] * (MAX + 1) facl [0] * (MAX + 1) [0] 0 MAX + 1 MAX 1 facl[0] = N facl[0] facl 0 N for i in range(1, MAX + 1):
    facl[i] = facl[i - 1] * (N - i) % MOD

# Solution i range(1, MAX + 1) range 1 MAX + 1 MAX 1 facl[i] = facl[i - 1] * (N - i) % MOD facl[i] facl i facl[i - 1] * (N - i) % MOD facl[i - 1] * (N - i) facl[i - 1] facl i - 1 i 1 N - i N i MOD ans = pow(2, N, MOD) - 1 ans pow(2, N, MOD) - 1 pow(2, N, MOD) pow 2 N MOD 1 ans -= facl[A - 1] * finv[A] % MOD ans facl[A - 1] * finv[A] % MOD facl[A - 1] * finv[A] facl[A - 1] facl A - 1 A 1 finv[A] finv A MOD ans %= MOD ans MOD ans -= facl[B - 1] * finv[B] % MOD ans facl[B - 1] * finv[B] % MOD facl[B - 1] * finv[B] facl[B - 1] facl B - 1 B 1 finv[B] finv B MOD ans %= MOD ans MOD print(ans) print ans MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD ans %= MOD MOD ans B = map(int, input().split()) map(int, input().split()) B MAX = 2 * 10 ** 5 + 1 2 * 10 ** 5 + 1 MAX facl = [0] * (MAX + 1) [0] * (MAX + 1) facl ans %= MOD MOD ans finv = [0] * (MAX + 1) [0] * (MAX + 1) finv ans -= facl[B - 1] * finv[B] % MOD facl[B - 1] * finv[B] % MOD ans N, A, B = map(int, input().split()) map(int, input().split()) N inv = [0] * (MAX + 1) [0] * (MAX + 1) inv fac = [0] * (MAX + 1) [0] * (MAX + 1) fac A, B = map(int, input().split()) map(int, input().split()) A ans = pow(2, N, MOD) - 1 pow(2, N, MOD) - 1 ans ans -= facl[A - 1] * finv[A] % MOD facl[A - 1] * finv[A] % MOD ans

N, A, B = map(int, input().split())

MAX = 2 * 10 ** 5 + 1
MOD = 10 ** 9 + 7

# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1

# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1

# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1

for i in range(2, MAX + 1):
    fac[i] = fac[i - 1] * i % MOD
    inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
    finv[i] = finv[i - 1] * inv[i] % MOD

# Factorial for large
facl = [0] * (MAX + 1)
facl[0] = N
for i in range(1, MAX + 1):
    facl[i] = facl[i - 1] * (N - i) % MOD

# Solution
ans = pow(2, N, MOD) - 1
ans -= facl[A - 1] * finv[A] % MOD
ans %= MOD
ans -= facl[B - 1] * finv[B] % MOD
ans %= MOD
print(ans)
