#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10, mod = 1e7 + 19;

int n, q, T, at[MAXN], bt[MAXN];
int tmp[MAXN], tot;
struct Qry
{
    int op, x, y;
}qt[MAXN];

inline ll Qpow(ll x, int y = mod - 2) {ll res = 1; while (y) (y & 1) && (res = res * x % mod), x = x * x % mod, y >>= 1; return res;}

ll pmdf[MAXN]; int pt[MAXN];

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif

    Read(n), Read(q);
    for (int i = 1; i <= q; i++)
    {
        Read(qt[i].op);
        if (qt[i].op != 6) Read(qt[i].x);
        if (qt[i].op == 1) Read(qt[i].y), qt[i].y %= mod;
        if (qt[i].op >= 2 && qt[i].op <= 4) qt[i].x %= mod;
        if (qt[i].op == 1 || qt[i].op == 5) tmp[++tot] = qt[i].x;
    }
    sort(tmp + 1, tmp + tot + 1), tot = unique(tmp + 1, tmp + tot + 1) - tmp - 1;
    for (int i = 1; i <= q; i++)
        if (qt[i].op == 1 || qt[i].op == 5) qt[i].x = lower_bound(tmp + 1, tmp + tot + 1, qt[i].x) - tmp;
    Read(T);
    for (int i = 1; i <= T; i++) Read(at[i]), Read(bt[i]);

    ll sum = 0, ans = 0;
    ll mdf = 0, mul = 1, add = 0; int gt = 0, cur = 0;
    for (int u = 1; u <= T; u++)    
        for (int v = 1; v <= q; v++)
        {
            int p = (at[u] + (ll)bt[u] * v) % q + 1; cur++;
            if (qt[p].op == 1)
            {
                sum = (sum - (pt[qt[p].x] < gt ? mdf * mul + add : pmdf[qt[p].x] * mul + add)) % mod;
                pt[qt[p].x] = cur, pmdf[qt[p].x] = (qt[p].y - add) * Qpow(mul) % mod;
                sum = (sum + qt[p].y) % mod;
            }
            else if (qt[p].op == 2)
            {
                add = (add + qt[p].x) % mod;
                sum = (sum + (ll)qt[p].x * n) % mod;
            }
            else if (qt[p].op == 3)
            {
                mul = mul * qt[p].x % mod, add = add * qt[p].x % mod;
                sum = sum * qt[p].x % mod;
            }
            else if (qt[p].op == 4)
            {
                mdf = qt[p].x, gt = cur, mul = 1, add = 0;
                sum = (ll)qt[p].x * n % mod;
            }
            else if (qt[p].op == 5)
            {
                ans = (ans + (pt[qt[p].x] < gt ? mdf * mul + add : pmdf[qt[p].x] * mul + add)) % mod;
            }
            else
            {
                ans = (ans + sum) % mod;
            }
        }
    cout << (ans + mod) % mod << '\n';
    return 0;
}