Priests of the Quetzalcoatl cult want to build a tower to represent a power of their god. Tower is usually made of power-charged rocks. It is built with the help of rare magic by levitating the current top of tower and adding rocks at its bottom. If top, which is built from k - 1 rocks, possesses power p and we want to add the rock charged with power wk then value of power of a new tower will be {wk}p. 

Rocks are added from the last to the first. That is for sequence w1, ..., wm value of power will be

<image>

After tower is built, its power may be extremely large. But still priests want to get some information about it, namely they want to know a number called cumulative power which is the true value of power taken modulo m. Priests have n rocks numbered from 1 to n. They ask you to calculate which value of cumulative power will the tower possess if they will build it from rocks numbered l, l + 1, ..., r. 

Input

First line of input contains two integers n (1 ≤ n ≤ 105) and m (1 ≤ m ≤ 109).

Second line of input contains n integers wk (1 ≤ wk ≤ 109) which is the power of rocks that priests have.

Third line of input contains single integer q (1 ≤ q ≤ 105) which is amount of queries from priests to you.

kth of next q lines contains two integers lk and rk (1 ≤ lk ≤ rk ≤ n). 

Output

Output q integers. k-th of them must be the amount of cumulative power the tower will have if is built from rocks lk, lk + 1, ..., rk.

Example

Input

6 1000000000
1 2 2 3 3 3
8
1 1
1 6
2 2
2 3
2 4
4 4
4 5
4 6


Output

1
1
2
4
256
3
27
597484987

Note

327 = 7625597484987
#include <bits/stdc++.h>
using namespace std;
long long n, p, a[2000005], q;
map<int, int> phi;
long long mod(long long a, long long b) { return a >= b ? ((a % b) + b) : a; }
long long qpow(long long x, long long y, long long m) {
  long long res = 1;
  while (y) {
    if (y & 1) res = mod(res * x, m);
    x = mod(x * x, m);
    y >>= 1;
  }
  return res;
}
long long get(long long u) {
  long long res = u, flg = u;
  if (phi[u]) return phi[u];
  for (int i = 2; i <= sqrt(u); i++) {
    if (u % i == 0) {
      res = res / i * (i - 1);
      while (u % i == 0) u /= i;
    }
  }
  if (u > 1) res = res / u * (u - 1);
  return phi[flg] = res;
}
long long solve(long long l, long long r, long long p) {
  if (l == r || p == 1) return mod(a[l], p);
  return qpow(a[l], solve(l + 1, r, get(p)), p);
}
int main() {
  scanf("%lld%lld", &n, &p);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  scanf("%lld", &q);
  while (q--) {
    long long l, r;
    scanf("%lld%lld", &l, &r);
    printf("%lld\n", solve(l, r, p) % p);
  }
  return 0;
}
