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 euler(int n) {
  int ans = n;
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      ans -= ans / i;
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) ans -= ans / n;
  return ans;
}
int eu[100110], sz;
int n, m, a[100110];
inline int pro(long long x, int mod) { return x < mod ? x : x % mod + mod; }
int cal(int x, int y, int mod) {
  int z = 1;
  for (; y; x = pro(1LL * x * x, mod), y >>= 1)
    if (y & 1) z = pro(1LL * z * x, mod);
  return z;
}
int dfs(int l, int r, int p) {
  if (l == r) return a[l] >= eu[p] ? a[l] % eu[p] + eu[p] : a[l];
  if (p == sz) return 1;
  return cal(a[l], dfs(l + 1, r, p + 1), eu[p]);
}
int main() {
  scanf("%d%d", &n, &m);
  while (m > 1) {
    eu[sz++] = m;
    m = euler(m);
  }
  eu[sz] = m;
  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) % eu[0]);
  }
  return 0;
}
