Problem: Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6).

You are given an array a of n integers. You have to process two types of queries:

  1. REPLACE l r — for every <image> replace ai with D(ai); 
  2. SUM l r — calculate <image>. 



Print the answer for each SUM query.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 3·105) — the number of elements in the array and the number of queries to process, respectively.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the elements of the array.

Then m lines follow, each containing 3 integers ti, li, ri denoting i-th query. If ti = 1, then i-th query is REPLACE li ri, otherwise it's SUM li ri (1 ≤ ti ≤ 2, 1 ≤ li ≤ ri ≤ n).

There is at least one SUM query.

Output

For each SUM query print the answer to it.

Example

Input

7 6
6 4 1 10 3 2 4
2 1 7
2 4 5
1 3 5
2 4 4
1 5 7
2 1 7


Output

30
13
4
22

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
long long Max[maxn << 2], sum[maxn << 2];
long long d[1000005];
void init() {
  int i, j;
  for (i = 1; i <= 1e6; i++) {
    d[i]++;
    for (j = i + i; j <= 1e6; j += i) {
      d[j]++;
    }
  }
}
void push_up(int rt) {
  Max[rt] = max(Max[rt << 1], Max[rt << 1 | 1]);
  sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void build(int l, int r, int rt) {
  if (l == r) {
    scanf("%lld", &sum[rt]);
    Max[rt] = sum[rt];
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
  push_up(rt);
}
void update(int L, int R, int l, int r, int rt) {
  if (L <= l && R >= r && Max[rt] <= 2) return;
  if (l == r) {
    sum[rt] = d[sum[rt]];
    Max[rt] = sum[rt];
    return;
  }
  int mid = (l + r) >> 1;
  if (L <= mid) update(L, R, l, mid, rt << 1);
  if (R > mid) update(L, R, mid + 1, r, rt << 1 | 1);
  push_up(rt);
}
long long query(int L, int R, int l, int r, int rt) {
  if (L <= l && R >= r) {
    return sum[rt];
  }
  int mid = (l + r) >> 1;
  long long ret = 0;
  if (L <= mid) ret += query(L, R, l, mid, rt << 1);
  if (R > mid) ret += query(L, R, mid + 1, r, rt << 1 | 1);
  return ret;
}
int main() {
  init();
  int n, m, t, l, r;
  scanf("%d%d", &n, &m);
  build(1, n, 1);
  while (m--) {
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1)
      update(l, r, 1, n, 1);
    else
      printf("%lld\n", query(l, r, 1, n, 1));
  }
  return 0;
}