little sub and his geometry problem

using namespace std;
int T;
typedef long long ll;

int n;
const int maxn = 1e5+100;
ll c[maxn];
int nu[maxn];

int (int x){
    return x&(-x);
}

void add(int x,int d){
    while(x<maxn){
        c[x]+=d;
        x+=lowbit(x);
    }
}

void add1(int x,int d){
    while(x<maxn){
        nu[x]+=d;
        x+=lowbit(x);
    }
}

ll sum(int x){
    ll ret = 0;
    while(x){
        ret+=c[x];
        x-=lowbit(x);
    }
    return ret;
}
int sum1(int x){
    int ret = 0;
    while(x){
        ret+=nu[x];
        x-=lowbit(x);
    }
    return ret;
}

typedef pair<int,int> P;
P r[maxn];
int k;
int q;
int num;
ll s;

ll check(int x,int yy){
    return 1LL*sum1(x)*(x+yy)-sum(x);
}

int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&k);
        for(int i=0;i<k;i++)scanf("%d%d",&r[i].first,&r[i].second);
        sort(r,r+k);
        scanf("%d",&q);
        while(q--){
        scanf("%lld",&s);
        ll res = 0;
        num = 0;
        for(int i=0;i<=n;i++)c[i] = 0,nu[i] = 0;
        int j = n;
        for(int i=1;i<=n;i++){
            while(r[num].first<=i&&num<k){
                add(r[num].second,r[num].second+r[num].first);
                add1(r[num].second,1);//用来统计有多少个点，计算总贡献
                num++;
            }
            while(check(j,i)>s&&j){
                j--;
            }
            if(!j)break;
            //如果有解，答案++
            if(check(j,i)==s)res++;
        }
        printf("%lld%c",res,!q?'n':' ');
        }
    }
    return 0;
}