#include <bits/stdc++.h>   using namespace std;   int r, g, j, f[200001], sc, kq, mod = round(1e9) + 7;   long long i, h;   int main() {     cin >> r >> g;     f[0] = 1;     for (i = 1; i * (i + 1) / 2 <= r + g; i++) {       for (j = r; j >= 0; j--) {         if (j >= i) f[j] = (f[j] + f[j - i]) % mod;       }     }     h = i - 1;     for (i = 0; i <= r; i++)       if (h * (h + 1) / 2 - i <= g) kq = (kq + f[i]) % mod;     cout << kq;   }   