#include <bits/stdc++.h>
using namespace std;
using LL = long long;
void Print() { cout << endl; }
template <typename T1, typename... T>
void Print(const T1 &t1, const T &...t) {
  cout << t1 << " ";
  Print(t...);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <class Iterator>
ostream &output_cantainer(ostream &os, Iterator first, Iterator last,
                          bool space = true) {
  if (space) {
    for (Iterator it = first; it != last; it++) {
      os << (*it) << ' ';
    }
    os << endl;
  } else
    for (Iterator it = first; it != last; it++) {
      os << (*it) << endl;
    }
  return os;
}
int dp[200005][2];
const int M = 1e9 + 7;
int main() {
  int r, g;
  cin >> r >> g;
  int a = 1, b = 1000;
  while (a <= b) {
    int m = a + (b - a) / 2, tot = m * (m + 1) / 2;
    if (tot <= r + g)
      a = m + 1;
    else
      b = m - 1;
  }
  int h = b;
  dp[0][0] = 1;
  for (int i = 1; i <= h; i++) {
    int tot = i * (i + 1) / 2, s = i & 1;
    for (int j = 0; j <= tot && j <= r; j++) {
      dp[j][s] = 0;
      if (j + g < tot) continue;
      dp[j][s] = dp[j][1 - s] % M;
      if (j >= i) dp[j][s] = (dp[j][s] + dp[j - i][1 - s]) % M;
    }
  }
  int ans = 0, s = h & 1;
  for (int j = 0; j <= r; j++) {
    ans = (ans + dp[j][s]) % M;
  }
  printf("%d\n", ans);
}
