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;
int n, m, a[300005], f[1000005];
long long sum[300005 << 2];
int mx[300005 << 2] = {};
void build(int x, int l, int r) {
  if (l == r) {
    sum[x] = mx[x] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(x << 1, l, mid);
  build(x << 1 | 1, mid + 1, r);
  mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
  sum[x] = sum[x << 1] + sum[x << 1 | 1];
}
void update(int x, int l, int r, int ql, int qr) {
  if (mx[x] <= 2) return;
  if (l == r) {
    sum[x] = mx[x] = f[mx[x]];
    return;
  }
  int mid = (l + r) >> 1;
  if (ql <= mid) update(x << 1, l, mid, ql, qr);
  if (qr > mid) update(x << 1 | 1, mid + 1, r, ql, qr);
  sum[x] = sum[x << 1] + sum[x << 1 | 1];
  mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}
long long query(int x, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) return sum[x];
  int mid = (l + r) >> 1;
  long long ret = 0;
  if (ql <= mid) ret += query(x << 1, l, mid, ql, qr);
  if (qr > mid) ret += query(x << 1 | 1, mid + 1, r, ql, qr);
  return ret;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  build(1, 1, n);
  for (int i = 1; i < 1000005; i++)
    for (int j = i; j < 1000005; j += i) f[j]++;
  while (m--) {
    int t, l, r;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1)
      update(1, 1, n, l, r);
    else
      printf("%I64d\n", query(1, 1, n, l, r));
  }
  return 0;
}