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;
const double eps = 1e-10;
const double PI = acos(-1.0);
const auto INF = 0x3f3f3f3f;
int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return x < 0 ? -1 : 1;
}
const int MAXN = 1e5 + 10;
const long long MOD = 1e9 + 7;
int a[MAXN], phi[MAXN];
int get(int n) {
  int ret = n;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) {
      ret = ret / i * (i - 1);
      while (n % i == 0) n /= i;
    }
  if (n != 1) ret = ret / n * (n - 1);
  return ret;
}
int gao(long long x, int m) { return x > m ? x % m + m : x; }
int qpow(int a, int b, int m) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = gao(1LL * ret * a, m);
    a = gao(1LL * a * a, m);
    b >>= 1;
  }
  return ret;
}
int dfs(int l, int r, int i) {
  if (l == r || phi[i] == 1) return gao(a[l], phi[i]);
  return qpow(a[l], dfs(l + 1, r, i + 1), phi[i]);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  phi[0] = m;
  for (int i = 1; i < 30; i++) {
    phi[i] = get(phi[i - 1]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d\n", dfs(l, r, 0) % m);
  }
  return 0;
}
