const int MAXN=1e5+10;
const int MAXK=1e6+10;
bool isNotPrime[MAXK];
void sieve(){
    for(ll i=2;i<MAXK;++i)
        if(!isNotPrime[i])
            for(ll j=i*i;j<MAXK;j+=i)
                isNotPrime[j]=1;
}

int arr[MAXN], tree[MAXN], lazy[MAXN];
void buildTree(int low, int high, int pos){
    int mid=(low+high)>>1;
    if(low==high)
        tree[pos] = arr[mid];
    else{
        buildTree(low, mid, 2*pos+1);
        buildTree(mid+1, high, 2*pos+2);

        tree[pos] = tree[2*pos+1]+tree[2*pos+2];
    }
    lazy[pos]=-1;
}

int queryTree(int low, int high, int pos, int qLow, int qHigh){
    if(lazy[pos]!=-1){
        tree[pos]=(high-low+1)*lazy[pos];
        lazy[2*pos+1]=lazy[2*pos+2]=lazy[pos];
        lazy[pos]=-1;
    }

    int mid=(low+high)>>1;
    if(qLow>high || qHigh<low)
        return 0;
    else if(qLow<=low && qHigh>=high)
        return tree[pos];
    else
        return queryTree(low,mid,2*pos+1,qLow,qHigh)+queryTree(mid+1,high,2*pos+2,qLow,qHigh);
}

void updateTree(int low,int high,int pos,int qLow,int qHigh,int val){
    if(lazy[pos]!=-1){
        tree[pos]=(high-low+1)*lazy[pos];
        lazy[2*pos+1]=lazy[2*pos+2]=lazy[pos];
        lazy[pos]=-1;
    }

    int mid=(low+high)>>1;
    if(qLow>high || qHigh<low)
        return ;
    else if(qLow<=low && qHigh>=high){
        tree[pos]=(high-low+1)*val;
        lazy[2*pos+1]=lazy[2*pos+2]=val;
    }
    else{
        updateTree(low,mid,2*pos+1,qLow,qHigh,val);
        updateTree(mid+1,high,2*pos+2,qLow,qHigh,val);
        tree[pos]=tree[2*pos+1]+tree[2*pos+2];
    }
}

void solve(){
    int n,q;
    cin>>n>>q;

    REP(i,n)
        cin>>arr[i],arr[i] = !isNotPrime[arr[i]];

    buildTree(0,n-1,0);

    int type,l,r,v;
    while(q--){
        cin>>type;
        if(!type){
            cin>>l>>r>>v;
            updateTree(0,n-1,0,l-1,r-1,!isNotPrime[v]);
        }
        else{
            cin>>l>>r;
            cout<<queryTree(0,n-1,0,l-1,r-1)<<endl;
        }
    }
}