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 int N = 100050;
const int S = 32000;
vector<int> Prime;
bool sieve[S];
void FindPrimes() {
  int i, j;
  for (i = 2; i < S; i++) {
    if (!sieve[i]) {
      Prime.push_back(i);
      for (j = i; j < S; j += i) sieve[j] = 1;
    }
  }
}
int phi(int x) {
  int i, ret = 1;
  for (i = 0; i < Prime.size() && Prime[i] * Prime[i] <= x; i++) {
    if (x % Prime[i]) continue;
    ret *= Prime[i] - 1;
    x /= Prime[i];
    while (!(x % Prime[i])) ret *= Prime[i], x /= Prime[i];
  }
  if (x > 1) ret *= x - 1;
  return ret;
}
long long modulo(long long a, long long b) {
  if (a < b)
    return a;
  else
    return (a % b) + b;
}
long long pow(long long x, long long k, long long mod) {
  long long ret = 1;
  for (; k; k >>= 1, x = modulo(x * x, mod))
    if (k & 1) ret = modulo(ret * x, mod);
  return ret;
}
long long a[N];
vector<long long> mod;
long long Solve(int l, int r, int lvl) {
  if (lvl == mod.size() || l == r + 1) return 1;
  long long k = Solve(l + 1, r, lvl + 1);
  long long ret = pow(a[l], k, mod[lvl]);
  return ret;
}
int main() {
  FindPrimes();
  int n, m, i, l, r, q;
  scanf("%i %i", &n, &m);
  mod.push_back(m);
  while (mod.back() != 1) mod.push_back(phi(mod.back()));
  for (i = 1; i <= n; i++) scanf("%i", &a[i]);
  scanf("%i", &q);
  while (q--) {
    scanf("%i %i", &l, &r);
    printf("%lld\n", Solve(l, r, 0) % m);
  }
  return 0;
}
