#include<iostream>
#include<algorithm>

using namespace std;

bool bin_search(int a[],int lo,int hi,int y)
{
    while(lo<=hi)
    {
        int mid=(lo+hi)/2;
        if(a[mid]==y) return 1;
        if(a[mid]<y) lo=mid+1;
        else hi=mid-1;
    }
    return 0;
}

int main()
{
    ///freopen("input.txt","r",stdin);
    int n,q;
    cin >> n >> q;
    int a[n];
    for(int i=0;i<n;i++) cin >> a[i];
    sort(a,a+n);
    while(q--)
    {
        int x; cin >> x;
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            if(a[i]==0 || x%a[i]!=0) continue;
            int y=x/a[i];
            if(bin_search(a,i+1,n-1,y)) cnt++;
        }
        if(cnt>0) cout << "Yes ";
        else cout << "No ";
        cout << cnt << endl;
    }
}
/**
11 5
10 6 3 20 2 30 7 13 11 14 5
60
91
121
14
70
**/