#include "iostream" #define ll long long using namespace std; int t,k,n,m,c[2001][2001],mo```cpp #include "iostream" #define ll long long using namespace std; int t,k,n,m,c[2001][2001],mod=1e9+7; ll init(ll a,ll b){ if(b==0)return 1; a%=mod; ll cas=init(a,b/2); if(b%2==0)return (cascas)%mod; return (cascas)%moda%mod; }ll inv(ll n){ return init(n,mod-2)%mod; }ll A(int n,int m){ ll sum=1; while(m--)sum=(sumn--)%mod; return sum%mod; }ll C(int n,int m){ return A(n,m)inv(A(m,m))%mod; }void Hn(int n){ ll ans = C(2n%mod,n)*inv(n+1)%mod; cout << ans; }signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t >> k; while(t--){ int n,m,cnt=0; cin >> n >> m; for(int i=0;i<=n;i++){ c[i][0]=c[i][i]=1; } for(int i=1;i<=n;i++){ for(int j=1;j<=min(i,m);j++) c[i][j]=(c[i-1][j] + c[i-1][j-1]) % k; } for(int i=0;i<=n;i++) for(int j=0;j<=min(i,m);j++) if(c[i][j]==0)cnt++; cout << cnt << '\n'; }exit(0); }