func_code_string: #include <bits/stdc++.h>   using namespace std;   using std::bitset;   const double Pi = acos(-1);   inline long long read() {     long long x = 0;     bool fu = 0;     char ch = 0;     while (ch >  9  || ch <  0 ) {       ch = getchar();       if (ch ==  - ) fu = 1;     }     while (ch <=  9  && ch >=  0 ) x = (x * 10 - 48 + ch), ch = getchar();     return fu ? -x : x;   }   long long n, mod, w[100002], q, l, r;   map<long long, long long> phi;   inline long long go(long long num) {     long long rt = num;     for (long long i = 2; i * i <= num; i++) {       if (num % i == 0) rt = rt * (i - 1) / i;       while (num % i == 0) num /= i;     }     if (num > 1) rt = rt * (num - 1) / num;     return rt;   }   inline long long pw(long long x, long long p, long long mod) {     bool flag = 0;     long long rt = 1;     while (p) {       if (p & 1) {         if (rt * x >= mod) flag = 1;         rt = rt * x % mod;       }       if (x * x >= mod) flag = 1;       x = x * x % mod, p >>= 1;     }     return rt + flag * mod;   }   inline long long dfs(long long pos, long long mod) {     if (pos > r || mod == 1) return 1;     return pw(w[pos], dfs(pos + 1, phi[mod]), mod);   }   signed main() {     cin >> n >> mod;     l = mod;     phi[1] = 1;     while (l > 1) phi[l] = go(l), l = phi[l];     for (register long long i = 1, iend = n; i <= iend; ++i) w[i] = read();     cin >> q;     while (q--) {       l = read(), r = read();       cout << dfs(l, mod) % mod <<   n ;     }     return 0;   }   