#include <map>

#include <set>

#include <stack>

#include <cmath>

#include <queue>

#include <cstdio>

#include <vector>

#include <string>

#include <bitset>

#include <cstring>

#include <iomanip>

#include <iostream>

#include <algorithm>

#define ls (r<<1)

#define rs (r<<1|1)

#define debug(a) cout << #a << " " << a << endl

using namespace std;

typedef long long ll;

const ll maxn = 1e5 + 10;

const double eps = 1e-8;

const ll mod = 1e9 + 7;

const ll inf = 1e9;

const double pi = acos(-1.0);

ll a[maxn];

int main() {

    std::ios::sync_with_stdio(false);

    ll n, q, sum = 0;

    scanf("%lld%lld",&n,&q);

    for( ll i = 0; i < n; i ++ ) {

        scanf("%lld",&a[i]);

        sum += a[i];

    }

    while( q -- ) {

        ll k;

        scanf("%lld",&k);

        if( sum%k || k > n ) {

            printf("No\n");

            continue;

        }

        ll ans = 0, avg = sum/k, cnt = 0;

        bool flag = false;

        for( ll i = 0; i < n; i ++ ) {

            ans += a[i]; //最后可能加上0，而0可以合并到前面区间，所以用ans=0来判断

        //开始用flag判断最后一位是否刚好可以让ans=avg，判断错了

        if( ans == avg ) {

                ans = 0;

                cnt ++;

            }

        }

        if( ans == 0 && cnt == k ) {

            printf("Yes\n");

        } else {

            printf("No\n");

        }

    }

    return 0;

}