#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
 
 
    #define int long long
    
 
#define YES cout<<"YES\n";return; 
#define NO cout<<"NO\n";return; 
#define write(a) cout<<a<<"\n";return; 
#define F first 
#define S second
 
using namespace std;
using vi=vector<int>; 
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); //uid<int> u1(5, 10); u1(rnd);
long long powmod(long long a,long long b,long long mod) {
        if (b==0 || a==1)  {if (mod==1) return 0; else return 1; }
       
        if (b%2==0) { long long k=powmod(a,b/2,mod); return (k*k)%mod; }
        else {long long k=powmod(a,b/2,mod); return ( (k*k) %mod *a)% mod; }
}
long long gcd(long long a, long long b) {
    if (a==0) return b;
    if (b==0) return a;
    if (a>b) return gcd(a%b,b); else return gcd(b%a,a);
}
int prime(int p) { // 1 - простое
if (p==1) return 0; 
    for (int i=2;i*i<=p;i++) {
    if (p%i==0 && i<p) return i;  
    }
    return 1;
}
        
 int inv(int a, int mod) {
    return powmod(a,mod-2,mod); 
}
            
 int random_modul() {
        
    uniform_int_distribution <int> u1(1e9, 2e9);
    int pepega=u1(rnd); 
    while (prime(pepega)!=1) pepega=u1(rnd); 
    return pepega; 
}
    
template <typename T1> void ifmax(T1 &max, T1 kek) {
    if (kek>max) max=kek; 
    return; 
}
template <typename T1> void ifmin(T1 &min, T1 kek) {
    if (kek<min) min=kek;
    return; 
}
     
 
template <typename T1> istream& operator>> (std::istream& in, pair<T1,T1> & a) {
in>>a.first>>a.second; 
return in; 
    
}
    
template <typename T1> istream& operator>> (std::istream& in, vector<T1> & a) {
    for (int i=0;i<a.size();i++) in>>a[i]; 
    return in;
} 
     
template <typename T1>  ostream& operator<< (std::ostream& out, vector <T1> &b) {
    for (int i=0;i<b.size();i++) out<<b[i]; 
    return out; 
} 
template <typename T1> void sort(vector <T1> &m) {
    sort(m.begin(),m.end());
}
 
template <typename T1> void reverse(vector <T1> &m) {
 reverse(m.begin(),m.end());
}
   
 
 
void solve () {
           
           
     /* ---- !! F, S !!  ---- */
         
    int a,q;
    cin>>a>>q;
    vi m(a);
    cin>>m;
    map <int,int> find; 
    map <int, vi> pos;
    
    vector <int> ans(q);
    int sum=0;
    int max1=0; 
    int min1=1000000000; 
    sort(m); 
    for (int i=0;i<a;i++) {
        sum+=m[i]; 
    }
    max1=m[a-1];
    min1=m[0]; 
    find[sum]=1;
    vector <int> pref(a);
    for (int i=0;i<a;i++) { if (i) pref[i]=pref[i-1]; pref[i]+=m[i]; } 
    queue <pair<int,int>> seg;
    map <pair<int,int>,bool> used; 
    
    seg.push({0,a-1});
    used[{0,a-1}]=true; 
    while (!seg.empty()) {
        pair <int,int> c=seg.front(); 
        seg.pop(); 
        find[pref[c.second]-(c.first?pref[c.first-1]:0)]=1; 
        int u=(m[c.first]+m[c.second])/2;
        // <= 
        int l=c.first;
        int r=c.second; 
        while (r-l) {
            int mid=(l+r)/2; if (mid==l) mid++; 
            if (m[mid]>u) r=mid-1; else l=mid; 
        }
        if (!used[{c.first,l}]) {used[{c.first,l}]=true; seg.push({c.first,l}); }
        if (l+1<=c.second && !used[{l+1,c.second}]) {used[{l+1,c.second}]=true; seg.push({l+1,c.second}); }
        
        // наибольший <= 
    }
    for (int i=0;i<q;i++) {
    int x; cin>>x; if (find[x]) cout<<"Yes\n"; else cout<<"No\n";     
    }
    
    /* --------- */  
    return;
    }
         
         
         
    signed main() {
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0); 
           
           
      cout<<fixed<<setprecision(10); 
           
           
        int multitest = 1 ;    
           
      int tututu;
      tututu=1;
              
      if (multitest) cin>>tututu; // если нет запросов, то закоментить
            
      for (int qwerty=0;qwerty<tututu;qwerty++) solve();
          
           
    return 0;
}