#pragma GCC optimize("Ofast") #include #define endl '\n' #define fi first #define se second using namespace std; mt19937 mt(123); void fileIO() { freopen("fantasy.in", "r", stdin); freopen("fantasy.out", "w", stdout); } void fastIO() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int q; int r[20005]; void solve() { cin>>q; for(int i=0;i<10000;i++) { r[i]=340000-50+i; } for(int i=0;i<10000;i++) { r[10000+i]=200000+(mt()%120000); } shuffle(r,r+20000,mt); for(int i=0;i>x; int d=__gcd(x,1000000); pair t={x/d,1000000/d}; if(t.fi<350000 && t.se<350000) { cout< s=t; for(int j=0;;j++) { t=s; if(j>20000) break; int cur=r[j]; double c=(double)t.se/cur; t.fi=(int)round((double)t.fi/c); t.se=cur; //cout<=350000) continue; if(t.se<1 || t.se>=350000) continue; cout<=350000) continue; if(t.se<1 || t.se>=350000) continue; cout<=350000) continue; if(t.se<1 || t.se>=350000) continue; cout<