#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=2000+10;
int c[maxn][maxn],f[maxn][maxn];
int t,k,n,m,cnt;

int main()
{
	freopen("problem.in","r",stdin);
	freopen("problem.out","w",stdout);
	
	scanf("%d%d",&t,&k);
	
	while(t)
	{
		t--;
		scanf("%d%d",&n,&m);
		cnt=0;memset(c,0,sizeof(c));
		memset(f,0,sizeof(f));
		for(int i=0;i<=n;i++)
		{
			c[i][0]=1;
		}	
		for(int i=0;i<=n;i++)
		for(int j=0;j<=min(i,m);j++)
		{
			if(c[i][j]==0)
				c[i][j]=(c[i-1][j]+c[i-1][j-1])%k;
			if(c[i][j]==0)
				f[i][j]=f[i][j-1]+1;
			else
				f[i][j]=f[i][j-1];
		}
		for(int i=0;i<=n;i++)
		{
			cnt+=f[i][min(i,m)];
		}
		printf("%d\n",cnt);
	}
	return 0;
}