`#include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

define endl ‘\n’

using namespace std;
using ll = long long;
using llu = unsigned long long;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const ll MIN = -9187201950435737472ll;
ll base = 131;
const int N = 5e5 + 10;
ll a[N],d[N],n,m,l,r,x,c[N];
char ty;
ll gcd(ll a,ll b)
{
return (b==0?a:gcd(b,a%b));
}
struct node{
ll val;
}seg[N4];
void motify(int x,ll d)
{
while(x<=n)
{
c[x]+=d;
x+=x&-x;
}
}
ll query(int x)
{
ll res=0;
while(x)
{
res+=c[x];
x-=x&-x;
}
return res;
}
void updata(int id)
{
seg[id].val=abs(gcd(seg[id2].val,seg[id2+1].val));
}
void change(int id,int l,int r,int x,ll d)
{
if(l==r&&l==x)
{
seg[id].val+=d;
return;
}
int mid=(l+r)>>1;
if(x<=mid)change(id2,l,mid,x,d);
else change(id2+1,mid+1,r,x,d);
updata(id);
}
ll ask(int id,int l,int r,int ql,int qr)
{
if(l==ql&&r==qr)
{
return abs(seg[id].val);
}
int mid=(l+r)>>1;
if(qr<=mid)return ask(id2,l,mid,ql,qr);
else if(ql>mid) return ask(id2+1,mid+1,r,ql,qr);
else
{
return abs(gcd(ask(id2,l,mid,ql,mid),ask(id2+1,mid+1,r,mid+1,qr)));
}
}
void build(int id,int l,int r)
{
if(l==r)
{
seg[id].val=d[l];
return;
}
int mid=(l+r)>>1;
build(id2,l,mid);
build(id*2+1,mid+1,r);
updata(id);
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i)cin>>a[i];
for(int i=1;i<=n;i)d[i]=a[i]-a[i-1];
build(1,1,n);
for(int i=1;i<=m;i++)
{
cin>>ty;
if(ty==’C’)
{
cin>>l>>r>>x;
motify(l,x);
motify(r+1,-x);
change(1,1,n,l,x);
if(r+1<=n)change(1,1,n,r+1,-x);
}
else if(ty==’Q’)
{
cin>>l>>r;
ll x=a[l]+query(l);
ll y=x;
if(l+1<=r)y=ask(1,1,n,l+1,r);
cout<<gcd(x,y)<<endl;
//cout<<x<<” “<<y<<endl;
}
}
return 0;
}

 ` `` ` 

`