#include <bits/stdc++.h>
using namespace std;
long long mM(long long a, long long b, long long p = 1000000007) {
  long long res = 0;
  if (a >= p) a %= p;
  while (b) {
    if (b & 1ll) res = (res + a);
    if (res >= p) res %= p;
    a = (2 * a);
    if (a >= p) a %= p;
    b >>= 1ll;
  }
  return res;
}
long long fpow(long long first, long long second, long long p = 1000000007) {
  if (first >= p) first = first % p;
  long long res = 1;
  while (second) {
    if (second & 1ll) res *= first;
    if (res < 0) res += p;
    if (res >= p) res %= p;
    second = second >> 1ll;
    first *= first;
    if (first < 0) first += p;
    if (first >= p) first %= p;
  }
  return res;
}
long long inv(long long n, long long p = 1000000007) {
  return fpow(n, p - 2, p);
}
long long modmul(long long first, long long second, long long p = 1000000007) {
  if (first < 0) first += p;
  if (first >= p) first %= p;
  if (second < 0) second += p;
  if (second >= p) second %= p;
  return (first * second) % p;
}
long long modadd(long long first, long long second, long long p = 1000000007) {
  if (first < 0) first += p;
  if (first >= p) first %= p;
  if (second < 0) second += p;
  if (second >= p) second %= p;
  long long temp = first + second;
  if (temp >= p) temp %= p;
  return temp;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    int r, g;
    cin >> r >> g;
    int h = 0;
    int sum = r + g;
    while (h * (h + 1) <= 2 * sum) h++;
    vector<long long> dp(r + 1, 0);
    dp[0] = 1;
    for (int i = 1; i < h; i++)
      for (int j = r; j >= 0; j--)
        if (i <= j)
          dp[j] = modadd(dp[j], dp[j - i]);
        else
          break;
    long long ans = 0;
    long long temp = (h * (h - 1)) / 2;
    for (int i = r; i >= 0; i--)
      if (temp - i <= g)
        ans = modadd(ans, dp[i]);
      else
        break;
    cout << ans << "\n";
  }
}
