#include using namespace std; #define int long long // aaaaaaaaaaaaaaaaaa #define rep(i,a,n) for (int i=a;i=a;i--) #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define allr(x) (x).rbegin(),(x).rend() #define fi first #define se second #define SZ(x) ((int)(x).size()) #define SIZE(buff) (sizeof(buff)/sizeof(buff[0])) typedef vector VI; typedef vector > VVI; typedef long long ll; typedef pair PII; const ll mod=1000000007; ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;} template ostream &operator<<(ostream &o,const vector&v) {o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<ostream& operator << (ostream& os, pair& pair_var) {os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;} // head int q,m,n,k,res,tmp,tmp2; int a[16][16] = {}; int b[200010] = {}; vector> v[305]; deque que; //int dp[305][305][305] = {}; string s; int ans[20000005] = {}; signed main() { cin.tie(0); ios::sync_with_stdio(false); std::cin >>n>>m; rep(i,0,(int)sqrt(m)+1){ rep(j,1,(int)sqrt(m)+1){ ans[i*i+j*j] += 1; } } res = 0; rep(i,n,m+1){ res = max(res,ans[i]); } cout<