#include<iostream>
#include<cstring>
#include<vector>
#include<array>
#include<algorithm>
#include<cassert>
using namespace std;
using LL = long long;
const int mod = 1e7 + 19;

void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
}

void sub(int &a, int b){
    a -= b;
    if (a < 0) a += mod;
}

int mul(int a, int b){
    return 1LL * a * b % mod;
}

int inv[mod];
int nums[100005], cnt;
int a[100005], stk[100005], top;

int get(int x){
    return lower_bound(nums + 1, nums + cnt + 1, x) - nums;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    inv[1] = 1;
    for(int i = 2; i < mod; i++){
        inv[i] = mul(mod - mod / i, inv[mod % i]);
    }

    int n, q;
    cin >> n >> q;
    vector<array<int, 3> > ops(q);
    for(int i = 0; i < q; i++){
        int op;
        cin >> op;
        if (op == 1){
            int x, y;
            cin >> x >> y;
            nums[++cnt] = x;
            y = (y % mod + mod) % mod;
            ops[i] = {op, x, y};
        }
        else if (op == 6){
            ops[i] = {op};
        }
        else{
            int x;
            cin >> x;
            x = (x % mod + mod) % mod;
            if (op == 3 and x % mod == 0){
                op = 4;
            }
            if (op == 5){
                nums[++cnt] = x;
            }
            ops[i] = {op, x};
        }
    }
    sort(nums + 1, nums + cnt + 1);
    cnt = unique(nums + 1, nums + cnt + 1) - nums - 1;
    for(auto &[op, x, y] : ops){
        if (op == 1 or op == 5) x = get(x);
    }

    int t;
    cin >> t;
    int add_all = 0, mul_all = 1, sum = 0, ans = 0;

    auto val = [&](int x){
        return int((1LL * mul_all * x + add_all) % mod);
    };

    for(int _ = 0; _ < t; _++){
        int aa, bb;
        cin >> aa >> bb;
        for(int j = 1; j <= q; j++){
            int id = (aa + 1LL * j * bb) % q;
            auto [op, x, y] = ops[id];
            if (op == 1){
                stk[++top] = x;
                sub(sum, val(a[x]));
                a[x] = mul(y + mod - add_all, inv[mul_all]);
                add(sum, val(a[x]));
            }
            else if (op == 2){
                add(sum, mul(x, n));
                add(add_all, x);
            }
            else if (op == 3){
                sum = mul(sum, x);
                mul_all = mul(mul_all, x);
                add_all = mul(add_all, x);
            }
            else if (op == 4){
                while(top){
                    a[stk[top--]] = 0;
                }
                sum = mul(x, n);
                add_all = x;
                mul_all = 1;
            }
            else if (op == 5){
                add(ans, val(a[x]));
                // cout << val(a[x]) << '\n';
            }
            else{
                add(ans, sum);
                // cout << sum << '\n';
            }
            // for(int j = 1; j <= n; j++){
            //     cout << val(a[j]) << " \n"[j == n];
            // }
        }
    }
    cout << ans << '\n';

}