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

def comb(n, r):
  c = 1
  m = 1
  r = min(n-r, r)
  for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
  return c * pow(m, mod-2, mod) % mod

nca = comb(n, a)
ncb = comb(n, b)
all -= nca + ncb
print(all%mod) n, a, b = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split a b mod = pow(10, 9) + 7 mod pow(10, 9) + 7 pow(10, 9) pow 10 9 7 all = pow(2, n, mod) - 1 all pow(2, n, mod) - 1 pow(2, n, mod) pow 2 n mod 1 def comb(n, r):
  c = 1
  m = 1
  r = min(n-r, r)
  for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
  return c * pow(m, mod-2, mod) % mod comb c = 1 c 1 m = 1 m 1 r = min(n-r, r) r min(n-r, r) min n-r n r r for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
   i range(r) range r c = c * (n - i) % mod c c * (n - i) % mod c * (n - i) c n - i n i mod m = m * (i + 1) % mod m m * (i + 1) % mod m * (i + 1) m i + 1 i 1 mod return c * pow(m, mod-2, mod) % mod c * pow(m, mod-2, mod) % mod c * pow(m, mod-2, mod) c pow(m, mod-2, mod) pow m mod-2 mod 2 mod mod n n r r nca = comb(n, a) nca comb(n, a) comb n a ncb = comb(n, b) ncb comb(n, b) comb n b all -= nca + ncb all nca + ncb nca ncb print(all%mod) print all%mod all mod a, b = map(int, input().split()) map(int, input().split()) a ncb = comb(n, b) comb(n, b) ncb def comb(n, r):
  c = 1
  m = 1
  r = min(n-r, r)
  for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
  return c * pow(m, mod-2, mod) % mod def comb(n, r):
  c = 1
  m = 1
  r = min(n-r, r)
  for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
  return c * pow(m, mod-2, mod) % mod comb mod = pow(10, 9) + 7 pow(10, 9) + 7 mod n, a, b = map(int, input().split()) map(int, input().split()) n all -= nca + ncb nca + ncb all nca = comb(n, a) comb(n, a) nca b = map(int, input().split()) map(int, input().split()) b all = pow(2, n, mod) - 1 pow(2, n, mod) - 1 all
n, a, b = map(int, input().split())
mod = pow(10, 9) + 7
all = pow(2, n, mod) - 1

def comb(n, r):
  c = 1
  m = 1
  r = min(n-r, r)
  for i in range(r):
    c = c * (n - i) % mod
    m = m * (i + 1) % mod
  return c * pow(m, mod-2, mod) % mod

nca = comb(n, a)
ncb = comb(n, b)
all -= nca + ncb
print(all%mod)