#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
**/
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGFsZ29yaXRobT4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpib29sIGJpbl9zZWFyY2goaW50IGFbXSxpbnQgbG8saW50IGhpLGludCB5KQp7CiAgICB3aGlsZShsbzw9aGkpCiAgICB7CiAgICAgICAgaW50IG1pZD0obG8raGkpLzI7CiAgICAgICAgaWYoYVttaWRdPT15KSByZXR1cm4gMTsKICAgICAgICBpZihhW21pZF08eSkgbG89bWlkKzE7CiAgICAgICAgZWxzZSBoaT1taWQtMTsKICAgIH0KICAgIHJldHVybiAwOwp9CgppbnQgbWFpbigpCnsKICAgIC8vL2ZyZW9wZW4oImlucHV0LnR4dCIsInIiLHN0ZGluKTsKICAgIGludCBuLHE7CiAgICBjaW4gPj4gbiA+PiBxOwogICAgaW50IGFbbl07CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKSBjaW4gPj4gYVtpXTsKICAgIHNvcnQoYSxhK24pOwogICAgd2hpbGUocS0tKQogICAgewogICAgICAgIGludCB4OyBjaW4gPj4geDsKICAgICAgICBpbnQgY250PTA7CiAgICAgICAgZm9yKGludCBpPTA7aTxuO2krKykKICAgICAgICB7CiAgICAgICAgICAgIGlmKGFbaV09PTAgfHwgeCVhW2ldIT0wKSBjb250aW51ZTsKICAgICAgICAgICAgaW50IHk9eC9hW2ldOwogICAgICAgICAgICBpZihiaW5fc2VhcmNoKGEsaSsxLG4tMSx5KSkgY250Kys7CiAgICAgICAgfQogICAgICAgIGlmKGNudD4wKSBjb3V0IDw8ICJZZXMgIjsKICAgICAgICBlbHNlIGNvdXQgPDwgIk5vICI7CiAgICAgICAgY291dCA8PCBjbnQgPDwgZW5kbDsKICAgIH0KfQovKioKMTEgNQoxMCA2IDMgMjAgMiAzMCA3IDEzIDExIDE0IDUKNjAKOTEKMTIxCjE0CjcwCioqLwo=