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 arr[100005], l, r;
map<long long, long long> phis;
long long getphi(long long n) {
  long long ans = n, m = sqrt(n);
  for (int i = 2; i <= m; i++) {
    if (n % i == 0) {
      ans = (ans / i) * (i - 1);
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) {
    ans *= (n - 1);
    ans /= n;
  }
  return ans;
}
long long bigmod(long long a, long long b, long long m) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans *= a;
      if (ans >= m) ans = ans % m + m;
    }
    a *= a;
    if (a >= m) a = a % m + m;
    b >>= 1;
  }
  return ans;
}
long long ddfs(long long i, long long mod) {
  if (i == r + 1 || mod == 1) return 1;
  long long p = ddfs(i + 1, phis[mod]);
  return bigmod(arr[i], p, mod);
}
int main() {
  long long n, m;
  scanf("%lld %lld", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%lld", &arr[i]);
  long long ans = m;
  while (ans != 1) {
    phis[ans] = getphi(ans);
    ans = phis[ans];
  }
  phis[ans] = 1;
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%lld %lld", &l, &r);
    ans = ddfs(l, m) % m;
    printf("%lld\n", ans);
  }
  return 0;
}
