******************************* *** The hack uses generator *** ******************************* ** Command line arguments ** no arguments ** Generated test ** 1 5000 999980001 999980005 999980009 999980013 999980017 999980021 999980025 999980029 999980033 999980037 999980041 999980045 999980049 999980053 999980057 999980061 999980065 999980069 999980073 999980077 999980081 999980085 999980089 999980093 999980097 999980101 999980105 999980109 999980113 999980117 999980121 999980125 999980129 999980133 999980137 999980141 999980145 999980149 999980153 999980157 999980161 999980165 999980169 999980173 999980177 999980181 999980185 999980189 999980193 999980197 99... ** Generator source ** #pragma GCC optimize("-Ofast,fast-math,-inline") #include using namespace std; //#define int long long using ll = long long; const int N = 5e5 + 5, MOD = 1e9 + 7, HSMOD = 1610612741, HSMOD2 = 998244353; // Remember to change /* struct FastMod { using ull=unsigned long long; using L=__int128; ull b,m; FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){} ull reduce(ull a)// return a mod b { ull q=(ull)((L(m)*a)>>64),r=a-q*b; return r>=b?r-b:r; } }F(330); // change the MOD*/ int n, m, q, t, a[N]; mt19937 rnd(381722); class Union_Find { public: int fa[N]; void Init() { for(int i=0;i>= 1ll; } return res; } ll inv(ll a) { return qpow(a, MOD - 2ll); } double dist(double X0, double Y0, double X1, double Y1) { return sqrt((X0 - X1) * (X0 - X1) + (Y0 - Y1) * (Y0 - Y1)); } inline bool isprime(int x) { if (x == 1) return 0; for (int i = 2; 1ll * i * i <= x; i++) if (x % i == 0) return 0; return 1; } namespace FastIo { #define QUICKCIN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0) int read() { char ch = getchar(); int x = 0, f = 1; while ((ch < '0' || ch > '9') && ch != '-') ch = getchar(); while (ch == '-') { f = -f; ch = getchar(); } while (ch >= '0' && ch <= '9') { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return x * f; } template void write(T x) { if (x < 0) { putchar('-'); x = -x; } if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template void writeln(T x) { write(x); putchar('\n'); } } template class Bit { public: T lowbit(T x) { return x & -x; } T tr[N]; void add(T x, T y) { while (x < N) { tr[x] += y; x += lowbit(x); } } T query(T x) { T sum = 0; while (x) { sum += tr[x]; x -= lowbit(x); } return sum; } }; #define x0 eesdugwerw #define y0 lfbsdbqwe #define x1 dqwieqqqwe #define y1 deiabdi int main() { //freopen("*.in", "r", stdin); //freopen("*.out", "w", stdout); ios::sync_with_stdio(0), cin.tie(0); cout<<"1\n5000\n"; uniform_int_distribution p(0,(int)1e9); for(int i=1,j=20000;i<=5000;i++,j-=4) { cout<<(int)1e9-j+1; if(i!=5000) cout<<" "; else cout<<"\n"; } for(int i=2;i<=5000;i++) { cout<