#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
int t,n,p;
class miku//矩阵
{
public:
	int n,m;
	LL s[10][10];
	miku()
	{
		memset(s,0,sizeof(s));
		n=m=0;
	}
	void make(int a)
	{
		n=m=a;
		for(int i=1;i<=n;i++)
				s[i][i]=1;
	}
	void print()
	{
		cout<<n<<" "<<m<<endl;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
				cout<<s[i][j]<<" ";
			cout<<endl;
		}
		cout<<endl;
	}
};
inline miku operator * (miku a,miku b)
{
	miku c;
	c.n=a.n;c.m=b.m;
	for(int i=1;i<=a.n;i++)
		for(int j=1;j<=b.m;j++)
		{
			for(int k=1;k<=a.m;k++)
			{
				c.s[i][j]+=a.s[i][k]*b.s[k][j];
				c.s[i][j]%=p;
			}
		}
	return c;
}
miku quickpow(miku S,int t)
{
	miku re;
	re.make(2);
	while(t>0)
	{
		if(t&1) re=re*S;
		S=S*S;t>>=1;
	}
	return re;
}
LL work()
{
	miku S;
	S.n=S.m=2;
	S.s[1][1]=1,S.s[1][2]=1;
	S.s[2][1]=1,S.s[2][2]=0;
	miku ans=quickpow(S,n-1);
	//ans.print();
	return ans.s[1][1];
}
int main()
{
	freopen("eins.in","r",stdin);
	freopen("eins.out","w",stdout);
	scanf("%d",&t);
	for(int i=1;i<=t;i++)
	{
		scanf("%d%d",&n,&p);
		//cout<<n<<" "<<p<<endl;
		printf("%d\n",work());
	}
	return 0;
}