n,a,b=map(int,input().split())
mod=1000000007
c=[1]*(b+1)
def com(n,b):
    for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod
com(n,b)
ans=(pow(2,n,mod)-c[a]-c[b]-1)%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=1000000007 mod 1000000007 c=[1]*(b+1) c [1]*(b+1) [1] 1 b+1 b 1 def com(n,b):
    for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod com for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod i range(1,b+1) range 1 b+1 b 1 c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod c[i] c i c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod c[i-1]*((n-i+1)*pow(i,mod-2,mod)) c[i-1] c i-1 i 1 (n-i+1)*pow(i,mod-2,mod) n-i+1 n-i n i 1 pow(i,mod-2,mod) pow i mod-2 mod 2 mod mod n n b b com(n,b) com n b ans=(pow(2,n,mod)-c[a]-c[b]-1)%mod ans (pow(2,n,mod)-c[a]-c[b]-1)%mod pow(2,n,mod)-c[a]-c[b]-1 pow(2,n,mod)-c[a]-c[b] pow(2,n,mod)-c[a] pow(2,n,mod) pow 2 n mod c[a] c a c[b] c b 1 mod print(ans) print ans a,b=map(int,input().split()) map(int,input().split()) a b=map(int,input().split()) map(int,input().split()) b def com(n,b):
    for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod def com(n,b):
    for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod com n,a,b=map(int,input().split()) map(int,input().split()) n mod=1000000007 1000000007 mod c=[1]*(b+1) [1]*(b+1) c ans=(pow(2,n,mod)-c[a]-c[b]-1)%mod (pow(2,n,mod)-c[a]-c[b]-1)%mod ans
n,a,b=map(int,input().split())
mod=1000000007
c=[1]*(b+1)
def com(n,b):
    for i in range(1,b+1):
        c[i]=c[i-1]*((n-i+1)*pow(i,mod-2,mod))%mod
com(n,b)
ans=(pow(2,n,mod)-c[a]-c[b]-1)%mod

print(ans)
