疑似本题史上最大漏洞

#include<bits/stdc++.h>
#define ll long long
#define itn int
//#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
int main()
{
	int t,p,x,y;
	cin>>t>>p;
	while(t--)
	{
		cin>>x>>y;
		for(int i=1;i>-1;i++)
		{
			if(x==0){cout<<1<<endl;break;}
			if(y==0){cout<<2<<endl;break;}
			if(i%2==1) x=(x+y)%p;
			else y=(x+y)%p;
			if(i>50000){cout<<"error"<<endl;break;}//重点
		}
	}
	return 0;
}