#include<bits/extc++.h>
using ll = long long;
constexpr ll mod = 1e7 + 19;
constexpr int maxq = 1e5 + 10;
ll inv[mod + 10];
__gnu_pbds::gp_hash_table<int, ll> val;
int op[maxq], qi[maxq]; ll  qx[maxq];
int main() {
   inv[0] = inv[1] = 1;
   for (int i = 2; i < mod; i++) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
   int n, q; scanf("%d%d", &n, &q);
   for (int i = 1; i <= q; i++) {
      scanf("%d", &op[i]);
      if (op[i] == 6);
      else if (op[i] == 1) scanf("%d%lld", &qi[i], &qx[i]);
      else if (op[i] == 5) scanf("%d", &qi[i]);
      else scanf("%lld", &qx[i]);
      qx[i] = (qx[i] % mod + mod) % mod;
      if (op[i] == 3 && qx[i] == 0) op[i] = 4;
   }
   int t; scanf("%d", &t);
   ll ans = 0, res = 0, sum = 0, mul = 1, add = 0;
   for (ll a, b; t--; ) {
      scanf("%lld%lld", &a, &b);
      for (int _ = 1; _ <= q; _++) {
         int id = (a += b) % q + 1;
         if (op[id] == 1) {
            ll fir = val.find(qi[id]) != val.end() ? val[qi[id]] : res;
            (sum += mod - fir) %= mod;
            fir = (qx[id] - add + mod) * inv[mul] % mod;
            val[qi[id]] = fir;
            (sum += fir) %= mod;
         } else if (op[id] == 2) {
            (add += qx[id]) %= mod;
         } else if (op[id] == 3) {
            (mul *= qx[id]) %= mod, (add *= qx[id]) %= mod;
         } else if (op[id] == 4) {
            res = qx[id], sum = qx[id] * n % mod, mul = 1, add = 0;
            val.clear();
         } else if (op[id] == 5) {
            ll fir = val.find(qi[id]) != val.end() ? val[qi[id]] : res;
            (ans += fir * mul + add) %= mod;
         } else if (op[id] == 6) {
            (ans += sum * mul + add * n) %= mod;
         }
      }
   }
   printf("%lld\n", ans);
   return 0;
}