求助，洛谷AC，但是 Atcoder WA

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
ll p;
struct matrix
{
    static const ll HASH = 13331;
    static const ll mod = 1e9+7;
    ll a[2][2];
    matrix() {memset(a, 0, sizeof(a));}
    ll* operator[](int x) {return a[x];}
    friend matrix operator*(matrix a, matrix b)
    {
        matrix c;
        c[0][0]=(a[0][0]*b[0][0]+a[0][1]*b[1][0])%p;
        c[0][1]=(a[0][0]*b[0][1]+a[0][1]*b[1][1])%p;
        c[1][0]=(a[1][0]*b[0][0]+a[1][1]*b[1][0])%p;
        c[1][1]=(a[1][0]*b[0][1]+a[1][1]*b[1][1])%p;
        return c;
    }
    ll getHash()
    {
        ll h=0;
        h=(h*HASH+a[0][0])%mod;
        h=(h*HASH+a[0][1])%mod;
        h=(h*HASH+a[1][0])%mod;
        h=(h*HASH+a[1][1])%mod;
        return h;
    }
};

ll a,b,x,t;
matrix e;

matrix qpow(matrix a, ll b)
{
    matrix ans=e;
    for(; b; b>>=1,a=a*a)
    if(b&1) ans=ans*a;
    return ans;
}
ll BSGS(matrix a, matrix b, matrix c)
{
    unordered_map<ll,ll> mp;
    ll sq=sqrt(p)+1;
    matrix s=qpow(a, sq),now=b;

    for(ll i=0; i<sq; i++)
    {
        ll h=(c*qpow(a, i)).getHash();
        if(!mp.count(h)) mp[h]=i;
    }

    for(ll i=0; i<=sq; i++)
    {
        if(mp.count(now.getHash())&&i*sq-mp[now.getHash()]>=0)
        return i*sq-mp[now.getHash()]+1;
        now=now*s;
    }
    return -1;
}
void work()
{
    matrix A,B,C;
    scanf("%lld%lld%lld%lld%lld", &p, &a, &b, &x, &t);
    A[0][0]=a; A[0][1]=0; A[1][0]=b; A[1][1]=1;
    B[0][0]=x; B[0][1]=1; C[0][0]=t; C[0][1]=1;
    if(!a)
    {
        if(t==x) puts("1");
        else if(t==b) puts("2");
        else puts("-1");
    }
    else
    {
        matrix A,B,C;
        A[0][0]=a; A[0][1]=0; A[1][0]=b; A[1][1]=1;
        B[0][0]=x; B[0][1]=1; C[0][0]=t; C[0][1]=1;
        printf("%lld\n", BSGS(A, B, C));
    }
}
int main()
{
    e[0][0]=e[1][1]=1;
    int t;
    cin>>t;
    while(t-->0)
    work();
    return 0;
}