#include<bits/stdc++.h>
#define ctz __builtin_ctz
using namespace std;
const int mod = 998244353;
const int maxn = 3e5+114;
const int maxp = 3e4+114;
const int maxB = 5000;
const int B = 200;
int n,q;
int b[maxn];
int a[maxn];
int tag[maxB]; 
int jump[maxn];
int dp[maxn];
vector< pair<int,int> > vec;//c = \prood p_i^{q_i}
int isPr[maxn],Pr[maxn],tot;
constexpr int add(int x,int y){return x+y<mod?x+y:x+y-mod;}
void init(){
    for(int i=2;i<maxn;i++){
        if(isPr[i]==0){
            Pr[++tot]=i;
        }
        for(int j=1;j<=tot;j++){
            if(1ll*i*Pr[j]>=maxn) break;
            isPr[i*Pr[j]]=Pr[j];
            if(i%Pr[j]==0) break;
        }
    }
}
int f;
void rebuild(int id,int c,int l,int r){
	f++;
    int L=B*(id-1)+1,R=min(id*B,n);
    for(int i=L;i<=R;i++){
        a[i]=1ll*a[i]*tag[id]%mod;
        if(l<=i&&i<=r&&c!=1){
            a[i]=1ll*a[i]*c%mod;
        }
    }
    for(int i=R;i>=L;i--){
        int to=i+i/b[i];
        jump[i]=(to>R?to:jump[to]);
        dp[i]=add(a[i],(to>R?0:dp[to]));
    }
    tag[id]=1;
}
int ask(int u){
    int sum=0;
    while(u<=n){
        int id=(u-1)/B+1;
        sum=(sum+1ll*dp[u]*tag[id])%mod;
        u=jump[u];
    }
    return sum;
}
map<int,int> mp[maxn],chifan;
set<int> S[maxn];
int main(){
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
    init();
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=i/__gcd(a[i],i);
        int res=b[i];
        while(isPr[res]!=0){
            int ct=0;
            int p=isPr[res];
            while(res%p==0) ct++,res/=p;
            S[p].insert(i);
            mp[i][p]=ct;
        }
        if(res!=1) S[res].insert(i),mp[i][res]=1;
    }
    for(int i=1;i<=(n-1)/B+1;i++){
        tag[i]=1;
        rebuild(i,1,1,n);
    }
    while(q--){
        int op;
        cin>>op;
        if(op==1){
            int l,r,c;
            cin>>l>>r>>c;
            int res=c;
            chifan.clear();
            while(isPr[res]!=0){
                int ct=0;
                int p=isPr[res];
                while(res%p==0) ct++,res/=p;
                vector<int> del;
                for(auto it=S[p].lower_bound(l);it!=S[p].end()&&(*it)<=r;it++){
                	int x=(*it);
                	if(chifan[x]==0) b[x]/=__gcd(b[x],c);
                	chifan[x]=1;
                	rebuild((x-1)/B+1,1,1,n);
                	mp[x][p]-=ct;
                	if(mp[x][p]<=0) del.push_back(x);
				}
				for(int x:del) S[p].erase(x);
            }
            if(res!=1){
            	vector<int> del;
                for(auto it=S[res].lower_bound(l);it!=S[res].end()&&(*it)<=r;it++){
                	int x=(*it);
                	if(chifan[x]==0) b[x]/=__gcd(b[x],c);
                	chifan[x]=1;
                	rebuild((x-1)/B+1,1,1,n);
                	mp[x][res]-=1;
                	if(mp[x][res]<=0) del.push_back(x);
				}
				for(int x:del) S[res].erase(x);
			}
            for(int i=1;i<=(n-1)/B+1;i++){
                int L=(i-1)*B+1,R=min(n,i*B);
                if(l<=L&&R<=r){
                   tag[i]=1ll*tag[i]*c%mod;
                }else if(max(l,L)<=min(r,R)) rebuild(i,c,l,r);
            }
        }else{
            int x;
            cin>>x;
            cout<<ask(x)<<'\n';
        }
    }
    return 0;
}