//#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <set>

#define DEBUG 1
#define TIME clock() / 1.0 / CLOCKS_PER_SEC

using namespace std;

const int N = (int)3e5 + 10;

int a[N];
int n, m;
int divisors[N];
long long T[4 * N];
set <int> s;

template < typename T >
T read(){
    T p = 1 , x = 0;
    char s = getchar();
    while(s == ' ' || s == '\n') s = getchar();
    if(s == '-') p = -1 , s = getchar();
    while(s >= '0' && s <= '9'){
        x = x * 10 + s - '0';
        s = getchar();
    }
    return x * p;
}

void update(int v, int l, int r, int pos, int val) {
    if(pos < l || pos > r)
        return;
    if(l == r) {
        T[v] = val;
    } else {
        int m = (l + r) >> 1;
        update(v * 2, l, m, pos, val);
        update(v * 2 + 1, m + 1, r, pos, val);
        T[v] = T[v * 2] + T[v * 2 + 1];
    }

}

long long get_sum(int v, int l, int r, int tl, int tr) {
    if(tl > r || tr < l)
        return 0;
    if(tl >= l && tr <= r)
        return T[v];
    int tm = (tl + tr) >> 1;
    return get_sum(v * 2, l, r, tl, tm) + get_sum(v * 2 + 1, l, r, tm + 1, tr);
}

void build(int v, int l, int r) {
    if(l == r) {
        T[v] = a[r];
    } else {
        int m = (l + r) >> 1;
        build(v * 2, l, m);
        build(v * 2 + 1, m + 1, r);
        T[v] = T[v * 2] + T[v * 2 + 1];
    }
}

void get_divisors(int n) {
    for(int i = 1; i <= n; ++i) {
        for(int j = i; j <= n; j += i)
            divisors[j]++;
    }
}

int main()
{
    #if DEBUG
        freopen("input.txt", "r", stdin);
        freopen("output.txt" , "w", stdout);
        ios_base::sync_with_stdio(false);
    #endif

    n = read<int>(), m = read<int>();
    get_divisors(n);
    for(int i = 1; i <= n; ++i) {
        a[i] = read<int>();
        int d = divisors[a[i]];
        if(a[i] != d) {
            s.insert(i);
        }
    }
    build(1, 1, n);

    for(int i = 0; i < m; ++i) {
        int type, l , r;
        type = read<int>(), l = read<int>(), r = read<int>();
        if(type == 1) {
            set <int>:: iterator itl, itr, it;
            itl = s.lower_bound(l);
            itr = s.upper_bound(r);
            vector <int> rem;
            for(it = itl; it != itr; ++it) {
                int cur = *it;
                int curd = divisors[a[cur]], d = a[cur];
                update(1, 1, n, cur, curd);
                if(curd == d) {
                    rem.push_back(cur);
                } else {
                    a[cur] = divisors[a[cur]];
                }
            }
            if(rem.size() != 0) {
                for(int j = 0; j < rem.size(); ++j) {
                    s.erase(rem[i]);
                }
            }

        } else {
            printf("%lld\n", get_sum(1, l, r, 1, n));
        }
    }

    return 0;
}