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;
template <class T>
void read(T &x) {
  char c;
  bool op = 0;
  while (c = getchar(), c < '0' || c > '9')
    if (c == '-') op = 1;
  x = c - '0';
  while (c = getchar(), c >= '0' && c <= '9') x = x * 10 + c - '0';
  if (op) x = -x;
}
template <class T>
void write(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar('0' + x % 10);
}
const int N = 100005;
int n, len, q, l, r;
long long m[N], w[N];
int phi(int x) {
  int ret = x;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ret = ret / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  if (x > 1) ret = ret / x * (x - 1);
  return ret;
}
long long Mod(long long a, long long b) { return a < b ? a : a % b + b; }
long long qpow(long long a, long long x, long long p) {
  long long ret = 1;
  while (x) {
    if (x & 1) ret = Mod(ret * a, p);
    a = Mod(a * a, p);
    x >>= 1;
  }
  return ret;
}
long long solve(int l, int r, int k) {
  if (k == r - l + 1 || k >= len) return Mod(w[r], m[k]);
  return qpow(w[l + k - 1], solve(l, r, k + 1), m[k]);
}
int main() {
  read(n), read(m[len = 1]);
  while (m[len] > 1) m[len + 1] = phi(m[len]), len++;
  for (int i = 1; i <= n; i++) read(w[i]);
  read(q);
  while (q--) {
    read(l), read(r);
    write(solve(l, r, 1) % m[1]), putchar('\n');
  }
  return 0;
}
