#2TLE求助

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int d[1000005];
void init(int n){
    d[1]=1;
    for(int i=2; i<=n; i++){
        for(int j=1; j*j<=i; j++){
            if(i%j==0){
                d[i]+=2;
                if(j==i/j) d[i]--;
            }
        }
    }
}
const int N=3e5+5,M=605;
int a[N],block[N],Max[M],total[M];
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    init(1000000);
    int n,m;
    cin>>n>>m;
    int a[n+5];
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    int blocklen=sqrt(n);
    for(int i=1; i<=n/blocklen+1; i++){
        for(int j=(i-1)*blocklen+1; j<=n&&j<=i*blocklen; j++){
            block[j]=i;
            total[i]+=a[j];
            int temp=a[j],cnt=0;
            while(temp!=d[temp]){
                cnt++;
                temp=d[temp];
            }
            Max[i]=max(Max[i],cnt);
        }
    }
    while(m--){
        int op,l,r;
        cin>>op>>l>>r;
        if(op==1){
            if(block[l]==block[r]){
                for(int i=l; i<=r; i++){
                    if(Max[block[i]]==0) break;
                    total[block[i]]-=a[i];
                    a[i]=d[a[i]];total[block[i]]+=a[i];
                }
            }
            else{
                int lblock=block[l]*blocklen,rblock=(block[r]-1)*blocklen+1;
                for(int i=l;i<=lblock; i++){
                    if(Max[block[i]]==0) break;
                    total[block[i]]-=a[i];
                    a[i]=d[a[i]];total[block[i]]+=a[i];
                }
                for(int i=block[l]+1; i<block[r]; i++){
                    if(Max[i]==0) continue;
                    Max[i]--;
                    for(int j=(i-1)*blocklen+1; j<=i*blocklen; i++){
                        total[i]-=a[j];
                        a[j]=d[a[j]];
                        total[i]+=a[j];
                    }
                }
                for(int i=rblock;i <=r; i++){
                    if(Max[block[i]]==0) break;
                    total[block[i]]-=a[i];
                    a[i]=d[a[i]];total[block[i]]+=a[i];
                }
            }
        }
        else{
            int ans=0;
            if(block[l]==block[r]){
                for(int i=l; i<=r; i++){
                    ans+=a[i];
                }
            }
            else{
                int lblock=block[l]*blocklen,rblock=(block[r]-1)*blocklen+1;
                for(int i=l;i<=lblock; i++){
                    ans+=a[i];
                }
                for(int i=block[l]+1; i<block[r]; i++){
                    ans+=total[i];
                }
                for(int i=rblock;i <=r; i++){
                    ans+=a[i];
                }
            }
            cout<<ans<<"\n";
        }
    }
    return 0;
}