#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>

using namespace std;
struct node 
{
	int x,y;
};
node a[1000000];
int n,max1;
int b[10000000];

int main()
{
	freopen("eins.in","r",stdin);
	freopen("eins.out","w",stdout);
	cin>>n;
	b[0]=0;b[1]=1;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&a[i].x,&a[i].y);
		if(a[i].x>max1)
			max1=a[i].x;
	}
	for(int i=2;i<=max1;i++)
	{
		b[i]=b[i-1]+b[i-2];
	}
	for(int i=1;i<=n;i++)
	{
		printf("%d\n",b[a[i].x]%a[i].y);
	}
	return 0;
}