n, a, b = map(int, input().split())
mod = 10**9 + 7
def nck(k):
    y, z = 1, 1
    for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
    return (y*z) % mod
 
ans = (pow(2, n, mod) - 1 - nck(a) - nck(b)) % 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 def nck(k):
    y, z = 1, 1
    for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
    return (y*z) % mod
  nck y, z = 1, 1 y 1 z 1 for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
     i range(1, k+1) range 1 k+1 k 1 y = (y * (n+1-i)) % mod y (y * (n+1-i)) % mod y * (n+1-i) y n+1-i n+1 n 1 i mod z = (z * pow(i, mod-2, mod)) % mod z (z * pow(i, mod-2, mod)) % mod z * pow(i, mod-2, mod) z pow(i, mod-2, mod) pow i mod-2 mod 2 mod mod return (y*z) % mod (y*z) % mod y*z y z mod k k ans = (pow(2, n, mod) - 1 - nck(a) - nck(b)) % mod ans (pow(2, n, mod) - 1 - nck(a) - nck(b)) % mod pow(2, n, mod) - 1 - nck(a) - nck(b) pow(2, n, mod) - 1 - nck(a) pow(2, n, mod) - 1 pow(2, n, mod) pow 2 n mod 1 nck(a) nck a nck(b) nck b mod print(ans) print ans mod = 10**9 + 7 10**9 + 7 mod b = map(int, input().split()) map(int, input().split()) b n, a, b = map(int, input().split()) map(int, input().split()) n def nck(k):
    y, z = 1, 1
    for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
    return (y*z) % mod
  def nck(k):
    y, z = 1, 1
    for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
    return (y*z) % mod
  nck a, b = map(int, input().split()) map(int, input().split()) a ans = (pow(2, n, mod) - 1 - nck(a) - nck(b)) % mod (pow(2, n, mod) - 1 - nck(a) - nck(b)) % mod ans
n, a, b = map(int, input().split())
mod = 10**9 + 7
def nck(k):
    y, z = 1, 1
    for i in range(1, k+1):
        y = (y * (n+1-i)) % mod
        z = (z * pow(i, mod-2, mod)) % mod
    return (y*z) % mod
 
ans = (pow(2, n, mod) - 1 - nck(a) - nck(b)) % mod
print(ans)