#include <bits/stdc++.h>
using namespace std;
const int N=1010;
int n,m;
int a[N],b[N];
int ksm(int x,int y,int mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ans*x)%mod;
		x=(x*x)%mod;
		y>>=1;
	}
	return ans%mod;
}
int main(){
	freopen("kdl.in","r",stdin);
	freopen("kdl.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	int opt,l,r,x,y,cnt,ans;
	while(m--){
		scanf("%d%d%d%d",&opt,&l,&r,&x);
		if(opt==1)
			for(int i=l;i<=r;i++) a[i]+=x;
		if(opt==2)
			for(int i=l;i<=r;i++) a[i]=x;
		if(opt==3){
			cnt=0;
			for(int i=l;i<=r;i++) b[++cnt]=a[i];
			sort(b+1,b+cnt+1);
			printf("%d\n",a[x+l-1]);
		}
		if(opt==4){
			scanf("%d",&y);
			ans=0;
			for(int i=l;i<=r;i++) ans=(ksm(a[i],x,y)+ans)%y;
			printf("%d\n",ans);
		}
	}
	return 0;
}