只需要循环58次√

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

int main()
{
    int t,mod;
    cin >> t >> mod;
    while (t--)
    {
        int x,y,a=0;
        cin >> x >> y;
        for (int i=0;i<58;i++)
        {
            if (i%2==0)
                x=(x+y)%mod;
            else
                y=(x+y)%mod;
            if (x==0)
            {
                cout << 1 << endl;
                a=1;
                break;
            }
            else if (y==0)
            {
                cout << 2 << endl;
                a=1;
                break;
            }
        }
        if (!a) cout << "error\n";
    }
	return 0;
}