#include <iostream>
#include <algorithm>
using namespace std;
long long C[2015][2015];
int main() {
	long long t, k, n, m;
	scanf("%d%d", &t, &k);
	for (long long i = 0; i <= 2000; i++) {
		C[i][0] = C[i][i] = 1;
		for (long long j = 1; j < i; j++)
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % k;
	}
	while (t--) {
		long long ans = 0;
		cin >> n >> m;
		for (long long i = 0; i <= n; i++)
			for (long long j = 0; j <= min(i, m); j++)
				ans += C[i][j] == 0;
		printf("%d\n", ans);
	}
	return 0;
}

19AC,1TLE求调！！！