#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;} //------------------------------------------------------- void solve() { int i,j,k,l,r,x,y; string s; vector> E; FOR(i,200000/5-1) { if(i==10000) { E.push_back({i*5,i*5+1}); E.push_back({i*5+1,i*5+2}); E.push_back({i*5+1-5,i*5+2-5}); } else if(i==10001) { E.push_back({i*5-2,i*5+1-2}); E.push_back({i*5+1-2,i*5+2-2}); E.push_back({i*5+2-2,i*5+3-2}); E.push_back({i*5+3-2,i*5+4-2}); E.push_back({i*5+1-5,i*5+2-2}); } else if(i<10000) { E.push_back({i*5,i*5+1}); E.push_back({i*5+1,i*5+2}); E.push_back({i*5+2,i*5+3}); E.push_back({i*5+3,i*5+4}); if(i) E.push_back({i*5+2-5,i*5+2}); } else if(i>10001) { E.push_back({i*5-2,i*5+1-2}); E.push_back({i*5+1-2,i*5+2-2}); E.push_back({i*5+2-2,i*5+3-2}); E.push_back({i*5+3-2,i*5+4-2}); if(i) E.push_back({i*5+2-5-2,i*5+2-2}); } } cout<