#include <bits/stdc++.h>

template <int Mod>
    class ModInt {
 public:
  ModInt() : n_(0) {}
  ModInt(long long n) : n_(n % Mod) {
    if (n_ < 0) {
      // In C++, (-n)%m == -(n%m).
      n_ += Mod;
    }
  }
  ModInt& operator+=(const ModInt& m) {
    n_ += m.n_;
    if (n_ >= Mod) {
      n_ -= Mod;
    }
    return *this;
  }
  ModInt& operator++() { return (*this) += 1; }
  ModInt& operator-=(const ModInt& m) {
    n_ -= m.n_;
    if (n_ < 0) {
      n_ += Mod;
    }
    return *this;
  }
  ModInt& operator--() { return (*this) -= 1; }
  ModInt& operator*=(const ModInt& m) {
    n_ *= m.n_;
    n_ %= Mod;
    return *this;
  }
  ModInt& operator/=(const ModInt& m) {
    *this *= m.inverse();
    return *this;
  }
#define DEFINE_BINARY_OPERATOR(op) \
  ModInt operator op(const ModInt& m) const { return ModInt(*this) op##= m; }
  DEFINE_BINARY_OPERATOR(+)
      DEFINE_BINARY_OPERATOR(-)
      DEFINE_BINARY_OPERATOR(*)
      DEFINE_BINARY_OPERATOR(/)
      #undef DEFINE_BINARY_OPERATOR
#define DEFINE_COMPARISON_OPERATOR(op) \
  bool operator op(const ModInt& m) const { return n_ op m.n_; }
      DEFINE_COMPARISON_OPERATOR(!=)
      DEFINE_COMPARISON_OPERATOR(<)
      DEFINE_COMPARISON_OPERATOR(<=)
      DEFINE_COMPARISON_OPERATOR(==)
      DEFINE_COMPARISON_OPERATOR(>)
      DEFINE_COMPARISON_OPERATOR(>=)
      #undef BDEFINE_COMPARISON_OPERATOR
      ModInt pow(int n) const {
    // a * b ^ n = answer.
    ModInt a = 1, b = *this;
    while (n != 0) {
      if (n & 1) {
        a *= b;
      }
      n /= 2;
      b *= b;
    }
    return a;
  }
  ModInt inverse() const {
    // Compute the inverse based on Fermat's little theorem. Note that this only
    // works when n_ and Mod are relatively prime. The theorem says that
    // n_^(Mod-1) = 1 (mod Mod). So we can compute n_^(Mod-2).
    return pow(Mod - 2);
  }
  long long value() const { return n_; }

  static ModInt factorial(int n) {
    for (int i = factorial_.size(); i <= n; ++i) {
      factorial_.push_back(i == 0 ? 1 : factorial_.back() * i);
    }
    return ModInt<Mod>::factorial_[n];
    /*
    if (int size = factorial_.size(); size < n + 1) {
      factorial_.resize(n + 1);
      for (int i = size; i <= n; ++i) {
        factorial_[i] = i == 0 ? 1 : factorial_[i - 1] * i;
      }
    }
    return factorial_[n];
    */
  }
  static ModInt combination(int n, int k) {
    ModInt num = 1;
    for (int i = 0; i < k; ++i) {
      num *= (n - i);
    }
    return num / factorial(k);
  }

 private:
  long long n_;
  static std::vector<ModInt> factorial_;
};

template<int Mod>
    std::vector<ModInt<Mod>> ModInt<Mod>::factorial_ = std::vector<ModInt<Mod>>();

template <int Mod>
    std::ostream& operator<<(std::ostream& out, const ModInt<Mod>& m) {
  out << m.value();
  return out;
}

// #undef DEBUG  // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
  std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
  std::cerr << value << ", ";
  debug(args...);
}
#define DBG(...)                              \
  do {                                        \
    cerr << #__VA_ARGS__ << ": ";             \
    debug(__VA_ARGS__);                       \
    cerr << " (L" << __LINE__ << ")" << endl; \
  } while (0)
#else
#define DBG(...)
#endif

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, n) for (auto i : (n))
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)

using ll = long long;
using mint = ModInt<1000000007>;

using namespace std;

int main() {
  int n, a, b;
  cin >> n >> a >> b;
  cout << (mint(2).pow(n) - 1 - mint::combination(n, a) - mint::combination(n, b)) << endl;
}


Measured memory_bytes: 2420