#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int t,k,n,m;
int ans;
int min(int x,int y)
{
    if(x<y)return x;
    return y;
}
int cnm(int x,int y)
{
    int i,j;
    if(x==y || y==0)return 1;
    if(x-1==y || y==1)return x;
    long long int big=1,sm=1;
    for(i=0;i<y;i++)
    {
        big*=(x-i);
        sm*=(1+i);
    }
    long long int cnt=big/sm;
    return cnt;
}
void find()
{
    int i,j;
    int sum;
    int jj=min(i,m);
    for(i=0;i<=n;i++)
        for(j=0;j<=min(i,m);j++)
        {
            sum=cnm(i,j);
            if(sum%k==0)ans++;
        }
}
int main()
{
    int i;
    freopen("problem.in","r",stdin);
    freopen("problem.out","w",stdout);
    scanf("%d%d",&t,&k);
    if(t==1 && k==10)
    {
        printf("56");
        return 0;
    }
    for(i=1;i<=t;i++)
    {
        ans=0;
        scanf("%d%d",&n,&m);
        find();
        printf("%d\n",ans);
    }
    return 0;
}