генератор

    cin >> n;
    cin >> a[0] >> l >> m;
    sorted_a[0] = a[0];
    b[0] = { a[0],0 };
    for (int i = 1; i < n; i++) {
        a[i] = (a[i - 1] * l + m) % MOD;
        b[i] = { a[i],i };
        sorted_a[i] = a[i];
    }

    int q;
    cin >> q;
    for (int I = 0; I < q; I++) {
        int G;
        cin >> G;
        long long x, lx, mx, y, ly, my, k, lk, mk, i, j;
        cin >> x >> lx >> mx >> y >> ly >> my >> k >> lk >> mk;
        i = min(x, y);
        j = max(x, y);
        for (int ii = 0; ii < G; ii++) {
            qr.push_back({ (int)i,(int)j,(int)k });
            x = ((i - 1) * lx + mx) % n + 1;
            y = ((j - 1) * ly + my) % n + 1;
            i = min(x, y);
            j = max(x, y);
            k = ((k - 1) * lk + mk) % (j - i + 1) + 1;
        }
    }