#include<bits/stdc++.h>
#define mid ((l+r)>>1)
using namespace std;
int n,q,a[200005];
int st[200005][31];
int uplim;
int solve(int l,int k){
	if(k<=uplim) return st[l][k];
	else return abs(solve(l,k-1)-solve(l+(1<<(k-1)),k-1));
}
int main(){
//	freopen("match.in","r",stdin);
//	freopen("match.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	uplim=log2(sqrt(n));
	for(int i=1;i<=n;i++){
		cin>>a[i];
		st[i][0]=a[i];
	}
	for(int i=1;i<=uplim;i++){
		for(int j=1;j+(1<<i)-1<=n;j++){
			st[j][i]=abs(st[j][i-1]-st[j+(1<<(i-1))][i-1]);
		}
	}
	while(q--){
		int op,x,y;
		cin>>op>>x>>y;
		if(op==1){
			a[x]=y;
			st[x][0]=y;
			for(int i=1;i<=uplim;i++){
				for(int j=max(x-(1<<i)+1,1);j<=x&&j+(1<<i)-1<=n;j++){
					st[j][i]=abs(st[j][i-1]-st[j+(1<<(i-1))][i-1]);
				}
			}
		}else{
			cout<<solve(x,y)<<'\n';
		}
	}
	return 0;
}