func_code_string: #include<bits/stdc++.h>   #define ll long long   #define vi vector<int>   #define vl vector<ll>    #define pb push_back   #define FASTANDFURIOUS ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);   #define rep(i,a,b) for(ll i=a;i<b;i++)   #define For(i,n) for(ll i=0;i<n;i++)   #define MOD 1000000007   #define MAX 100001   #define pll pair <ll,ll>   #define pii pair <int,int>   #define dbg(x)    cout << #x <<  :   << x << endl;   #define fi first   #define se second   #define read(n,v) For(i,n)cin>>v[i]   #define mkp make_pair   #define YES cout<< YES n ;   #define NO cout<< NO n ;   #define No cout<< No n ;   #define Yes cout<< Yes n ;   #define INF 1e18   using namespace std;        ll ncr2(ll n, ll k )   {       if (k > n) return 0;       if (k * 2 > n) k = n-k;       if (k == 0) return 1;           ll result = n;       for(ll i = 2; i <= k; ++i ) {           result = result * (n-i+1);           result /= i;       }       return result;   }   ll pow(ll x, unsigned int y, int p){       ll res=1;       x=x%p;       if (x==0) return 0;       while (y > 0)       {           if (y & 1)               res = (res*x) % p;           y = y>>1;           x = (x*x) % p;       }       return res;   }   ll _pow(ll a, ll b){       if(!b)           return 1;       ll temp = _pow(a, b / 2);       temp = (temp * temp);       if(b % 2)           return (a * temp);       return temp;   }   ll invmod(ll a,ll m){       return pow(a,m-2,m);   }   ll feelthepower(ll x,ll y){       ll res = 1LL;       while(y){           if(y&1){               res = (res*1LL*x)%MOD;           }           x = (x*1LL*x)%MOD;           y/=2;       }       return res;   }   // ll ncr(ll n,ll r)   // {   //     if(n<r)   //         return 0;   //     ll ans=fac[n];   //     ans*=invmod(fac[n-r],MOD);   //     ans%=MOD;   //     ans*=invmod(fac[r],MOD);   //     ans%=MOD;   //     return ans;   // }   bool has(int kek,int d){       while(kek){           int temp = kek%10;           if(temp == d){               return true;           }           kek/=10;       }       return false;   }   signed main(){       FASTANDFURIOUS;       #ifndef ONLINE_JUDGE       freopen( input.txt ,  r , stdin);       freopen( output.txt ,  w , stdout);       #endif       int tc=1;       cin>>tc;       For(ti,tc){           int n,d;           cin>>n>>d;           For(i,n){               string s;               cin>>s;               if(s.length()>2){                   cout<< YES n ;               }               else{                   int req = stoi(s);                   int flag=0;                   while(req>=0){                       if(has(req,d)){                           flag=1;                           break;                       }                       else{                           req-=d;                      }                   }                   if(flag){                       cout<< YES n ;                   }                   else{                       cout<< NO n ;                   }               }           }       }   }