#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- ll A,B; int ok[295][86400]; void solve() { int i,j,k,l,r,x,y; string s; cin>>A>>B; if(A>B) swap(A,B); if(A>=85344) { ll v=0; while((v+1000)*(v+1001)*(2*v+2001)/6<=A+B) v+=1000; while((v+1)*(v+2)*(2*v+3)/6<=A+B) v++; cout<=(i+1)*(i+1)) ok[i+1][j]|=ok[i][j-(i+1)*(i+1)]; } int num=0; FOR(j,85400) if(ok[i+1][j]&&j<=A) cand=max(cand,j); } A=min(A,(ll)cand); ll v=0; while((v+1000)*(v+1001)*(2*v+2001)/6<=A+B) v+=1000; while((v+1)*(v+2)*(2*v+3)/6<=A+B) v++; cout<