#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Tree{
	int l,r;
	int value; //存的max 
	int awa,ewe;
}tree[11451414];
int n,s,m;
int num[11451414];
int now,fu;
 
void bulid(int &v,int l,int r) {
	v = ++fu;
	tree[v].ewe=1e18;
	if (l == r) {
		tree[v].value = num[l];
	}
	else {
		int mid = l + r >> 1;
		bulid(tree[v].l,l,mid);
		bulid(tree[v].r,mid + 1,r);
		tree[v].value = max(tree[tree[v].l].value , tree[tree[v].r].value);
	}
}

void push_down(int v,int l,int r,int add,int turn){
	if(turn != 1e18) {
		tree[v].value = (l + r) * turn;
		tree[v].ewe = turn;
		tree[v].awa = 0; 
	}
	else {
		tree[v].value += (l + r) * add;
		if (tree[v].ewe == 1e18) tree[v].awa += add;
		else tree[v].ewe += add;
	}
}

void two(int v,int l,int r,int ll,int rr,int add,int turn) {
	if (l == ll && r == rr) {
		push_down(v,l,r,add,turn);
	}
	else {
		int mid = l + r >> 1;
		push_down(tree[v].l,l,mid,tree[v].awa,tree[v].ewe);
		push_down(tree[v].r,mid + 1,r,tree[v].awa,tree[v].ewe);
		tree[v].ewe = 1e18;
		tree[v].awa = 0;
		if (rr <= mid) {
			two(tree[v].l,l,mid,ll,rr,add,turn);
		}
		else if (ll > mid) {
			two(tree[v].r,mid + 1,r,ll,rr,add,turn);
		}
		else {
			two(tree[v].l,l,mid,ll,mid,add,turn);
			two(tree[v].r,mid + 1,r,mid + 1,rr,add,turn);
		}
		tree[v].value = tree[tree[v].l].value + tree[tree[v].r].value;
	}
}

int three(int v,int l,int r,int ll,int rr,int k) {
	if (l == r) {
		return pow(tree[v].value,k);
	}
	else if (l == ll && r == rr) {
		int mid = l + r >> 1;
		push_down(tree[v].l,l,mid,tree[v].awa,tree[v].ewe);
		push_down(tree[v].r,mid + 1,r,tree[v].awa,tree[v].ewe);
		tree[v].awa = 0;
		tree[v].ewe = 1e18;
		return three(tree[v].l,l,mid,ll,mid,k) + three(tree[v].r,mid + 1,r,mid + 1,rr,k);
	}
	else {
		int mid = l + r >> 1;
		push_down(tree[v].l,l,mid,tree[v].awa,tree[v].ewe);
		push_down(tree[v].r,mid + 1,r,tree[v].awa,tree[v].ewe);
		tree[v].awa = 0;
		tree[v].ewe = 1e18;
		if (rr <= mid) {
			return three(tree[v].l,l,mid,ll,rr,k);
		}
		else if (ll > mid) {
			return three(tree[v].r,mid + 1,r,ll,rr,k);
		}
		else {
			return three(tree[v].l,l,mid,ll,mid,k) + three(tree[v].r,mid + 1,r,mid + 1,rr,k);
		}
	}
}


signed main ( ) {
	cin >> n >> m ;
	for (int i = 1;i <= n;i++) {
		scanf("%lld",&num[i]) ;
	}
	int r;
	bulid(r,1,n);

	for (int i = 1;i <= m;i++) {
		int t,x,y,k;
		scanf("%lld",&t);
		if (t == 2) {
			scanf("%lld%lld%lld",&x,&y,&k);
			two(r,1,n,x,y,0,k);
		}
		else if (t == 1) {
			scanf("%lld%lld%lld",&x,&y,&k);
			two(r,1,n,x,y,k,1e18);
		}
		else {
			scanf("%lld%lld%lld",&x,&y,&k);
			printf("%lld\n",three(r,1,n,x,y,k) / 10) ;
		}
	}
}