poj1995

#include<iostream>#include<cstdio>using namespace std;long long PowMod(long long a, long long b, long long c){    long ans =1;    a = a%c;    while(b > 0)    {        if(b%2==1)            ans = (ans*a)%c;        b = b/2;        a = (a*a)%c;    }    return ans;}int main(){    int t;    cin >> t;    while(t--)    {        long m, m1, m2, z, x;        cin >> m;        int n;        cin >> n;        x = 0;        for(int i = 0; i < n; i++)        {            cin >> m1 >> m2;            z = PowMod(m1,m2,m);            x = (x+z)%m;        }        cout << x << endl;    }}