#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXQ = 1e5 + 5;
const int mod = 1e7 + 19;

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

ll inv[mod + 5];

struct Oper
{
	int oper, id, val;
}a[MAXQ];

int dsc[MAXQ], dcnt=0;

int cur=0, tag[MAXQ], now_val[MAXQ];

int n, chg=0, p=1, q=0, sum=0, ans=0;

void solve(const Oper &op)
{
	int oper = op.oper, id = op.id, val = op.val;
	if(oper==1)
	{
		val = ((val - q) * inv[p] %mod + mod) %mod;
		int lst = tag[id] >= cur? now_val[id]: chg;
		
		sum = (sum + (ll)(val - lst + mod) * p) %mod;
		
		tag[id] = cur;
		now_val[id] = val; 
	}
	else if(oper==2)
	{
		add_mod(q, val);
		sum = (sum + (ll)n * val) %mod;
	}
	else if(oper==3)
	{
		p = (ll)p * val %mod;
		q = (ll)q * val %mod;
		sum = (ll)sum * val %mod;
	}
	else if(oper==4)
	{
		chg = val;
		p = 1;
		q = 0;
		sum = (ll)n * val %mod;
		++cur;
	}
	else if(oper==5)
	{
		ll now = tag[id] >= cur? now_val[id]: chg;
		ans = (ans + now * p + q) %mod;
	}
	else
	{
		add_mod(ans, sum);
	}
}

int main(void)
{
	inv[1] = 1;
	for(int i=2; i<mod; ++i)
		inv[i] = (mod-mod/i) * inv[mod%i] %mod;
	
	int Q;
	scanf("%d%d",&n,&Q);
	for(int i=1; i<=Q; ++i)
	{
		int oper;
		scanf("%d",&oper);
		a[i].oper = oper;
		if(oper==1 || oper==5) scanf("%d",&a[i].id);
		if(oper<=4)
			scanf("%d",&a[i].val),
			a[i].val = (a[i].val %mod + mod) %mod;
		
		if(a[i].oper==3 && a[i].val==0)
			a[i].oper=4;
	}
	
	for(int i=1; i<=Q; ++i)
		if(a[i].id) dsc[++dcnt] = a[i].id;
	sort(dsc+1,dsc+dcnt+1);
	dcnt = unique(dsc+1,dsc+dcnt+1) - dsc - 1;
	for(int i=1; i<=Q; ++i)
		if(a[i].id) a[i].id = lower_bound(dsc+1,dsc+dcnt+1, a[i].id) - dsc;
	
	int T;
	scanf("%d",&T);
	while(T--)
	{
		ll a,b;
		scanf("%lld%lld",&a,&b);
		for(int i=1; i<=Q; ++i)
		{
			int now = (a + i*b) %Q + 1;
			solve(::a[now]);
		}
	}
	
	printf("%d",ans);
	return 0;
}