Problem:
Score : 400 points

Problem Statement

Akari has n kinds of flowers, one of each kind.

She is going to choose one or more of these flowers to make a bouquet.

However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.

How many different bouquets are there that Akari can make?

Find the count modulo (10^9 + 7).

Here, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.

Constraints

All values in input are integers.

2 \leq n \leq 10^9

1 \leq a < b \leq \textrm{min}(n, 2 \times 10^5)

Input

Input is given from Standard Input in the following format:

n a b

Output

Print the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)

Sample Input 1

4 1 3

Sample Output 1

7

In this case, Akari can choose 2 or 4 flowers to make the bouquet.

There are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.

Sample Input 2

1000000000 141421 173205

Sample Output 2

34076506

Print the count modulo (10^9 + 7).

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

const MOD: usize = 1000000007;

fn repeat_sq(n: i64, p: i64, m: i64) -> i64 {
    if p == 0 {
        return 1;
    }

    if p % 2 == 0 {
        let t = repeat_sq(n, p / 2, m) % m;
        t * t % m
    } else {
        n * repeat_sq(n, p - 1, m) % m
    }
}

fn main() {
    let v = read_vec::<i64>();
    let n = v[0];
    let a = v[1];
    let b = v[2];
    let m = MOD as i64;

    let mut ans = repeat_sq(2, n, m);
    ans = (ans + m - 1) % m;

    let fac = |n, k, m| {
        let mut f = 1;
        for i in (1..n + 1).rev() {
            f *= i;
            f %= m;
            if i == n - k + 1 {
                break;
            }
        }
        f
    };

    let xa = fac(n, a, m);
    let xb = fac(n, b, m);
    let aa = fac(a, a, m);
    let bb = fac(b, b, m);
    let ya = repeat_sq(aa, m - 2, m);
    let yb = repeat_sq(bb, m - 2, m);
    //println!("{} {} {} {} {}", ans, xa, xb, ya, yb);

    ans = ((ans + m) - xa * ya % m - xb * yb % m) % m;

    println!("{}", ans);
}

#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}
#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn yn(result: bool) {
    if result {
        println!("Yes");
    } else {
        println!("No");
    }
}