#include <bits/stdc++.h>

using namespace std;

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

const double PI = acos(-1);

const long long MOD = 1000000007;
long long f[100000+1];
long long rf[100000+1];

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

long long comb(int n, int r) {
  return f[n] * rf[r] % MOD * rf[n-r] % MOD;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  f[0] = 1;
  for (int i = 1; i <= 100000; i++)
    f[i] = i * f[i-1] % MOD;
  rf[100000] = modpow(f[100000], MOD-2, MOD);
  for (int i = 99999; i >= 0; i--)
    rf[i] = rf[i+1] * (i+1) % MOD;

  int n, m;
  cin >> n >> m;
  
  long long ret = 0;
  for (int x = n; x <= m; x++) {
    ret += comb(x, n);
    ret %= MOD;
  }
  cout << ret << endl;
  
  return 0;
}