As the weakest one of all the pigeons, good luck!

https://github.com/joric/interviewbit/blob/master/programming/graph-data-structure-and-algorithms/smallest-sequence-with-given-primes.md

This fact simplifies the implementation significantly:

For me, E is a simple divide and conquer problem. But I didn't bother to try D despite having 1 hour left, because of its complexity.

I went through all of the Indian Submissions and almost all seem AI generated. Hopefully the admins take strict action.

as for the code:

with complexity O(n+q)

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
struct block{
    int x,y;
}a[N];
int n,w,q;
int id[N],idx[N],cnt[N],tl[N];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL),cout.tie(NULL);
    cin>>n>>w;
    for(int i=1;i<=n;++i){cin>>a[i].x>>a[i].y;}
    cin>>q;
    for(int i=1;i<=n;++i){
        id[a[i].x]++;
        idx[i]=id[a[i].x];
        cnt[id[a[i].x]]++;
        tl[id[a[i].x]]=max(a[i].y,tl[id[a[i].x]]);
    }
    while(q--){
        int t,pos;
        cin>>t>>pos;
        if(cnt[idx[pos]]!=w){cout<<"Yes\n";}
        else{
            if(t<tl[idx[pos]]){cout<<"Yes\n";}
            else{cout<<"No\n";}
        }
    }
    return 0;
}

in fact, we don't need to sort

check this: video by maroonrk