A - Raising Modulo Numbers

https://vjudge.net/contest/278754#problem/A

#include<iostream>
#include<cstdio>
using namespace std;
long long n,m,ans,i,t,p,nn,ans1;
int main()
{
    scanf("%lld",&t);
    while (t--)
    {
        scanf("%lld",&p);
        scanf("%lld",&nn);
        ans1=0;
        for (i=1; i<=nn; i++)
        {
            scanf("%lld%lld",&n,&m);
            ans=1;
            while (m)
            {
                if (m&1) ans=((ans%p)*(n%p))%p;
                n=(n%p)*(n%p)%p;
                m=m>>1;
            }
            ans1=(ans1+ans)%p;
        }
        printf("%lld\n",ans1%p);
    }
}