n,a,b=map(int,input().split())

def genCombinationFunction(max_k,mod):
    modinv_table = [-1] * (max_k+1)
    modinv_table[1] = 1
    for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

    def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
    return binomial_coefficients

  
max_k = 2 * 10 ** 5
mod = 10**9 + 7
f=genCombinationFunction(max_k,mod)


ans=pow(2,n,mod)-1
ans-=f(n,a)
ans-=f(n,b)
print(ans%mod) n,a,b=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split a b def genCombinationFunction(max_k,mod):
    modinv_table = [-1] * (max_k+1)
    modinv_table[1] = 1
    for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

    def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
    return binomial_coefficients

   genCombinationFunction modinv_table = [-1] * (max_k+1) modinv_table [-1] * (max_k+1) [-1] -1 max_k+1 max_k 1 modinv_table[1] = 1 modinv_table[1] modinv_table 1 1 for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

     i range(2, max_k+1) range 2 max_k+1 max_k 1 modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod modinv_table[i] modinv_table i (-modinv_table[mod % i] * (mod // i)) % mod -modinv_table[mod % i] * (mod // i) -modinv_table[mod % i] modinv_table[mod % i] modinv_table mod % i mod i mod // i mod i mod def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
     binomial_coefficients ans = 1 ans 1 for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
         i range(k) range k ans *= n-i ans n-i n i ans *= modinv_table[i + 1] ans modinv_table[i + 1] modinv_table i + 1 i 1 ans %= mod ans mod return ans ans n n k k return binomial_coefficients binomial_coefficients max_k max_k mod mod max_k = 2 * 10 ** 5 max_k 2 * 10 ** 5 2 10 ** 5 10 5 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 f=genCombinationFunction(max_k,mod) f genCombinationFunction(max_k,mod) genCombinationFunction max_k mod ans=pow(2,n,mod)-1 ans pow(2,n,mod)-1 pow(2,n,mod) pow 2 n mod 1 ans-=f(n,a) ans f(n,a) f n a ans-=f(n,b) ans f(n,b) f n b print(ans%mod) print ans%mod ans mod n,a,b=map(int,input().split()) map(int,input().split()) n max_k = 2 * 10 ** 5 2 * 10 ** 5 max_k f=genCombinationFunction(max_k,mod) genCombinationFunction(max_k,mod) f ans=pow(2,n,mod)-1 pow(2,n,mod)-1 ans ans-=f(n,b) f(n,b) ans a,b=map(int,input().split()) map(int,input().split()) a def genCombinationFunction(max_k,mod):
    modinv_table = [-1] * (max_k+1)
    modinv_table[1] = 1
    for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

    def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
    return binomial_coefficients

   def genCombinationFunction(max_k,mod):
    modinv_table = [-1] * (max_k+1)
    modinv_table[1] = 1
    for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

    def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
    return binomial_coefficients

   genCombinationFunction ans-=f(n,a) f(n,a) 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())

def genCombinationFunction(max_k,mod):
    modinv_table = [-1] * (max_k+1)
    modinv_table[1] = 1
    for i in range(2, max_k+1):
        modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod

    def binomial_coefficients(n, k):
        ans = 1
        for i in range(k):
            ans *= n-i
            ans *= modinv_table[i + 1]
            ans %= mod
        return ans
    return binomial_coefficients

  
max_k = 2 * 10 ** 5
mod = 10**9 + 7
f=genCombinationFunction(max_k,mod)


ans=pow(2,n,mod)-1
ans-=f(n,a)
ans-=f(n,b)
print(ans%mod)