//Shirasu Azusa 2024.5
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=1e6+5,mod=998244353;

namespace Poly {
  const int mod=998244353,gg=3,ig=332748118;
  int lim,r[N],a[N],b[N],c[N],d[N],e[N],h[N];
  void init(int n) {
    int l=0;
    for(lim=1;lim<=n;lim<<=1,l++);
    rep(i,0,lim) r[i]=(r[i>>1]>>1)|((i&1)<<l-1);
  }
  int pls(int x,int y) {return x+=y,x>=mod?x-mod:x;}
  int mns(int x,int y) {return x-=y,x<0?x+=mod:x;}
  int ksm(int x,int y,int ret=1) {
    while(y) {
      if(y%2) ret=ret*x%mod;
      x=x*x%mod, y>>=1;
    }
    return ret;
  }
  void ntt(int *f,int lim,int t) {
    rep(i,0,lim-1) if(i<r[i]) swap(f[i],f[r[i]]);
    for(int len=1;len<lim;len<<=1) {
      int dw=ksm(t>0?gg:ig,(mod-1)/(len*2));
      for(int i=0;i<lim;i+=len*2) {
        int w=1;
        for(int j=0;j<len;j++,w=w*dw%mod) {
          int x=f[i+j], y=w*f[i+j+len]%mod;
          f[i+j]=pls(x,y), f[i+j+len]=mns(x,y);
        }
      }
    }
    if(t==-1) {
      int iv=ksm(lim,mod-2);
      rep(i,0,lim) f[i]=f[i]*iv%mod;
    }
  }
  void mul(int *f,int *g,int len) {
    init(len);
    ntt(f,lim,1), ntt(g,lim,1);
    rep(i,0,lim-1) f[i]=f[i]*g[i]%mod;
    ntt(f,lim,-1);
  }
}
using Poly::mul;

int n,m,k,a[N],b[30][N],pos[N],tot,x[N],y[N],pp[N],cc[N];

void calc(int *x,int *y) {
  static int pp[N],qq[N],res[N];
  rep(i,0,4*m) res[i]=0;
  rep(i,0,4*m) pp[i]=qq[i]=0;
  rep(i,0,m) pp[i]=x[i]*x[i]%mod*x[i]%mod;
  rep(i,0,m) qq[i]=y[i]%mod;
  mul(pp,qq,2*m);
  rep(i,0,m) res[i]=(res[i]+pp[i])%mod;
  rep(i,0,4*m) pp[i]=qq[i]=0;
  rep(i,0,m) pp[i]=x[i];
  rep(i,0,m) qq[i]=y[i]*y[i]%mod*y[i]%mod;
  mul(pp,qq,2*m);
  rep(i,0,m) res[i]=(res[i]+pp[i])%mod;
  rep(i,0,4*m) pp[i]=qq[i]=0;
  rep(i,0,m) pp[i]=x[i]*x[i]%mod;
  rep(i,0,m) qq[i]=(mod-2)*y[i]%mod*y[i]%mod;
  mul(pp,qq,2*m);
  rep(i,0,m) res[i]=(res[i]+pp[i])%mod;
  rep(i,0,m) x[i]=res[i];
}
void work(int r,int *b) {
  rep(i,0,4*m) x[i]=y[i]=0;
  rep(i,1,r) x[pp[i]]=cc[i];
  rep(i,0,m) y[i]=a[m-i];
  calc(x,y);
  rep(i,1,m) b[i]=!!x[m-i];
}

signed main() {
  n=read(), k=read(); int lim=0;
  rep(i,1,n) {
    int x=read(), c=read();
    pp[i]=x; cc[i]=c; a[x]=c;
    chmax(lim,x);
  } m=lim;
  work(n,b[0]);
  for(int l=1,r=n;l<=r;) {
    int mid=(l+r)>>1;
    ++tot; pos[tot]=mid; work(mid,b[tot]);
    if(l==r) break; r=mid;
  }
  rep(i,1,k) {
    int cc=read(), ans=0;
    if(!b[0][cc]) {
      ans=0;
    } else {
      ans=1;
      per(i,tot,1) {
        if(!b[i][cc]) ans=pos[i]+1;
      }
    }
    printf("%lld\n",ans);
  }
  return 0;
}