#include<string>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>using namespace std;int r,c,l,t,n,m,k,i,j,hang[5000],lie[5000];
int main()
{
//    freopen("word.in","r",stdin);
//    freopen("word.out","w",stdout);cin>>n>>m>>k;for(i=1;i<=k;++i){cin>>r>>c;if(r==1) hang[c]=i;if(r==2) lie[c]=i;}for(i=1;i<=n;++i){for(j=1;j<=m;++j){if(hang[i]>lie[j]) cout<<hang[i]<<" ";else cout<<lie[j]<<" ";}cout<<endl;}fclose(stdin);fclose(stdout);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;char s[50][3],t[50][3];
char a[10];
int n,q,ans;
bool vis[50];inline int read()
{int a=0,f=1; char c=getchar();while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}return a*f;
}bool judge(int x)
{if (x==n&&a[n]=='a') return true;for (int i=1;i<=q;i++)if (s[i][1]==a[x]&&s[i][2]==a[x+1]){int tmp=a[x+1];a[x+1]=t[i][1];int flag=judge(x+1);a[x+1]=tmp;if (flag) return true;}return false;
}void dfs(int x)
{if (x==n+1) {if (judge(1)) ans++;return;}for (int i=0;i<6;i++){a[x]=i+'a';dfs(x+1);}
}int main()
{freopen("merge.in","r",stdin);freopen("merge.out","w",stdout);n=read(); q=read();for (int i=1;i<=q;i++){scanf("%s",s[i]+1); scanf("%s",t[i]+1);}dfs(1);cout<<ans<<endl;fclose(stdin);fclose(stdout);return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;const int mod=1e9+7;
const int N=200005;
int n,m,K[N],b[N];
struct node
{int l,r;long long mul,sum;
}t[N<<2];inline int read()
{int a=0,f=1; char c=getchar();while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}return a*f;
}inline node Unite(node x,node y)
{node ans;ans.l=x.l; ans.r=y.r;ans.mul=x.mul*y.mul%mod;ans.sum=(x.sum*y.mul%mod+y.sum)%mod;return ans;
}inline void pushup(int k)
{t[k]=Unite(t[k<<1],t[k<<1|1]);
}void build(int k,int x,int y)
{if (x==y){t[k].l=t[k].r=x;t[k].sum=b[x];t[k].mul=K[x];return;}int mid=x+y>>1;build(k<<1,x,mid); build(k<<1|1,mid+1,y);pushup(k);
}void modify(int k,int x,int K,int B)
{if (t[k].l==t[k].r){t[k].sum=B;t[k].mul=K;return;}int mid=t[k].l+t[k].r>>1;if (x<=mid) modify(k<<1,x,K,B); else modify(k<<1|1,x,K,B);pushup(k);
}node query(int k,int x,int y)
{if (t[k].l==x&&t[k].r==y) return t[k];int mid=t[k].l+t[k].r>>1;if (y<=mid) return query(k<<1,x,y);else if (x>mid) return query(k<<1|1,x,y);else return Unite(query(k<<1,x,mid),query(k<<1|1,mid+1,y));
}int main()
{freopen("fx.in","r",stdin);freopen("fx.out","w",stdout);n=read(); m=read();for (int i=1;i<=n;i++)K[i]=read(),b[i]=read();build(1,1,n);for (int i=1;i<=m;i++){char opt[5];scanf("%s",opt);if (opt[0]=='M'){int x=read(),k=read(),b=read();modify(1,x,k,b);}else{int l=read(),r=read(),x=read();node ans=query(1,l,r);printf("%I64d\n",(ans.mul*x%mod+ans.sum)%mod);}}fclose(stdin);fclose(stdout);return 0;
}