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;
int n, m, q;
int num[200011];
int phi[200011], lp;
int Phi(int x) {
  int ans = x;
  for (int i = 2; 1ll * i * i <= x; i++)
    if (x % i == 0) {
      ans = 1ll * ans * (i - 1) / i;
      while (x % i == 0) x /= i;
    }
  if (x > 1) ans = 1ll * ans * (x - 1) / x;
  return ans;
}
bool check(int L, int R, int cur) {
  for (int i = L; i <= R; i++)
    if (num[i] == 1) {
      R = i;
      break;
    }
  long long last = num[R];
  for (int i = R - 1; i >= L; i--) {
    long long mi = last;
    last = 1;
    for (int j = 1; j <= mi; j++) {
      last *= num[i];
      if (last >= phi[cur]) return 1;
    }
  }
  return 0;
}
int powmod(int a, long long b, int p) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = 1ll * ans * a % p;
    a = 1ll * a * a % p;
    b >>= 1;
  }
  return ans;
}
long long calc(int L, int R) {
  for (int i = L; i <= R; i++)
    if (num[i] == 1) {
      R = i;
      break;
    }
  long long last = num[R];
  for (int i = R - 1; i >= L; i--) {
    long long mi = last;
    last = 1;
    for (int j = 1; j <= mi; j++) last *= num[i];
  }
  return last;
}
int play(int L, int R, int cur) {
  if (phi[cur] == 1) return 0;
  int now = num[L] % phi[cur];
  if (now == 0) return 0;
  if (now == 1) return 1;
  if (L == R) return now;
  if (check(L + 1, min(R, L + 6), cur))
    return powmod(now, play(L + 1, R, cur + 1) + phi[cur + 1], phi[cur]);
  return powmod(now, calc(L + 1, min(R, L + 6)), phi[cur]);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
  phi[0] = m;
  lp = 0;
  while (phi[lp] != 1) lp++, phi[lp] = Phi(phi[lp - 1]);
  scanf("%d", &q);
  int x, y;
  while (q--) {
    scanf("%d%d", &x, &y);
    printf("%d\n", play(x, y, 0) % m);
  }
  return 0;
}
