#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const int P    = 1e7 + 19;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {
    x = max(x, y);
}
template <typename T> void chkmin(T &x, T y) {
    x = min(x, y);
}
template <typename T> void read(T &x) {
    x = 0;
    int f = 1;
    char c = getchar();

    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -f;

    for (; isdigit(c); c = getchar())
        x = x * 10 + c - '0';

    x *= f;
}
int power(int x, int y) {
    if (y == 0)
        return 1;

    int tmp = power(x, y / 2);

    if (y % 2 == 0)
        return 1ll * tmp * tmp % P;
    else
        return 1ll * tmp * tmp % P * x % P;
}
void update(int &x, int y) {
    x += y;

    if (x >= P)
        x -= P;
}
map <int, int> mp;
int n, m, q, ans, sum, inv;
pair <int, int> a[MAXN];
pair <int, int> tag, all;
int type[MAXN], home[MAXN], val[MAXN];
void work(int timer, int type, int home, int val) {
    if (type == 1) {
        if (a[home].first < all.first)
            update(sum, P - (1ll * all.second * tag.first + tag.second) % P);
        else
            update(sum, P - (1ll * a[home].second * tag.first + tag.second) % P);

        a[home].first = timer;
        a[home].second = 1ll * (val - tag.second + P) * inv % P;
        update(sum, val);
    }

    if (type == 2) {
        update(tag.second, val);
        update(sum, 1ll * n * val % P);
    }

    if (type == 3) {
        sum = 1ll * sum * val % P;
        inv = 1ll * inv * home % P;
        tag.first = 1ll * tag.first * val % P;
        tag.second = 1ll * tag.second * val % P;
    }

    if (type == 4) {
        sum = 1ll * n * val % P;
        all = make_pair(timer, val);
        tag = make_pair(1, 0), inv = 1;
    }

    if (type == 5) {
        if (a[home].first < all.first)
            update(ans, (1ll * all.second * tag.first + tag.second) % P);
        else
            update(ans, (1ll * a[home].second * tag.first + tag.second) % P);
    }

    if (type == 6) {
        update(ans, sum);
    }
}
int main() {
    read(n), read(q);

    for (int i = 1; i <= q; i++) {
        read(type[i]);

        if (type[i] == 1) {
            read(home[i]), read(val[i]);
            val[i] = (val[i] % P + P) % P;
        } else if (type[i] == 5)
            read(home[i]);
        else if (type[i] != 6) {
            read(val[i]);
            val[i] = (val[i] % P + P) % P;
        }

        if (type[i] == 3) {
            if (val[i] == 0)
                type[i] = 4;
            else
                home[i] = power(val[i], P - 2);
        }
    }

    for (int i = 1; i <= q; i++) {
        if (type[i] == 1 || type[i] == 5) {
            if (mp.count(home[i]))
                home[i] = mp[home[i]];
            else
                home[i] = mp[home[i]] = ++m;
        }
    }

    int T;
    read(T);
    int timer = 1;
    inv = 1;
    tag = make_pair(1, 0);

    while (T--) {
        int x, y;
        read(x), read(y);
        y %= q, x = (x + y) % q;

        for (int i = 1; i <= q; i++, x = (x + y) >= q ? (x + y - q) : (x + y), timer++)
            work(timer, type[x + 1], home[x + 1], val[x + 1]);
    }

    cout << ans << endl;
    return 0;
}