#include <iostream>
#include <random>
#include <algorithm>
#include <set>
#include <vector>

using namespace std;

const int MAX_UDI = 100000000;

int main(int argc, char* argv[]) {
    int n = atoi(argv[1]);
    int m = atoi(argv[2]);
    int seed = atoi(argv[3]);

    std::mt19937 rng(seed);

    std::uniform_int_distribution<int> udi(-MAX_UDI, MAX_UDI);
    std::uniform_int_distribution<int> indices(1, n);
    std::uniform_int_distribution<int> coin(0, 1);

    vector<int> e;
    for (int i = 0; i < n ; ++i) {
        e.push_back(udi(rng));
    }
 
 
    cout << n << endl;
    for (int i = 0; i < n; ++i) {
        cout << e[i];
        if (i < n - 1) {
            cout << " ";
        }
    }
    cout << endl;

    cout << m << endl;
    for (int i = 0; i < m; ++i) {
        int s = indices(rng);
        int f = indices(rng);
        if (s > f) {
            int t = s;
            s = f;
            f = t;
        }
        if (coin(rng) == 0) {
            cout << "check " << s << " " << f << endl;
        } else {
            int d = udi(rng);
            cout << "update " << s << " " << f << " " << -d << endl;
        }
    }

    return 0;
}