**********************************
*** Взлом использует генератор ***
**********************************

** Аргументы командной строки **
нет аргументов

** Сгенерированный тест **
10
20000 1000000000 1 7
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 1...

** Исходный код генератора **
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vl = vector<ll>;
using vul = vector<ull>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<double>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using xy = pair<ll, ll>;
using vxy = vector<xy>;
using vvxy = vector<vxy>;
using cmp = complex<double>;
using vc = vector<cmp>;
using vvvl = vector<vvl>;

#define rep(i, n) for (ll i = 0; i < (n); i++)
#define cnt(i, n, m) for (ll i = (n); i <= (m); i++)
#define echo(ite, C) for (auto ite = (C).begin(); ite != (C).end(); ite++)
#define recho(ite, C) for (auto ite = (C).rbegin(); ite != (C).rend(); ite++)
#define yn(b) cout << ((b > 0) ? "Yes" : "No") << endl;
#define bfind(a, b) (((a) >> (b)) & 1ll)
#define bset(a, b, c) ((c != 0) ? (a) | (1ll << (b)) : ~((~(a)) | (1 << (b))))
#define nth(a, b) (((a) >> (b)) & 1)

int main() {
  ll T = 10;
  ll N = 20000;
  ll K = 1000000000;
  cout << T << endl;
  vl Nxt(N), Pnt(N);
  rep(i, N) {
    Nxt[i] = i + 1;
    Pnt[i] = 1 + i;
  }

  rep(i, T) {
    ll PB = (i % N) + 1;
    ll PS = ((N + T / 2 + 1 - i) % N) + 1;
    cout << N << " " << K << " " << PB << " " << PS << endl;
    echo(ite, Nxt) cout << *ite << " ";
    cout << endl;
    echo(ite, Pnt) cout << *ite << " ";
    cout << endl;
  }
  return 0;
}