CM Prime Queries

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bitset<100010>ck;
vector<int>prime;
void sieve(int z)
{
    ll i,j,k;
    int x=z+1;
    ck.set();
    ck[0]=ck[1]=0;
    for(i=2;i<3;i++){
        for(j=2*2;j<=x;j+=2)ck[j]=0;
        prime.push_back(i);
    }
    for(;i<=x;i+=2)if(ck[i]){
        for(j=i*i,k=2*i;j<=x;j+=k)ck[j]=0;
        prime.push_back(i);
    }
}
int main()
{
    sieve(1e5);
    int i,j,t,x,y,p_cnt;
    ll re;
    scanf("%d",&t);
    while(t--){
        scanf("%d %d",&x,&y);
        for(i=1,re=0;i<=x;i++)
            for(j=i,p_cnt=0;j<=x;j++){
                if(ck[j])p_cnt++;
                if(p_cnt==y+1)break;
                re++;
        }
        printf("%lld\n",re);
    }
    return 0;
}