1478B - Nezzar and Lucky Number - CodeForces Solution

from math import *
from sys import *
from bisect import bisect_left as bl
from bisect import bisect_right as br
from collections import Counter as ctr
from collections import deque as dq

input =stdin.readline

inp = lambda  : int(input())
li  = lambda  : list(map(int,input().split()))
lb  = lambda  : list(map(int,input().split()[0]))
ls  = lambda  : list(input())
bi  = lambda n: bin(n).replace("0b", "")
yn  = lambda f: print('NYOE S'[f::2])
srp = lambda s,i,c : s[:i]+c+s[i+1:]

'''def isprime(a):
    if a==2: return True
    elif a%2==0: return False
    n=3
    while n<=a**0.5:
        if a%n==0:
            return False
        n+=2
    return True
'''
'''def nf(n,a):
    b=a*a
    c=b*a
    d=c*a
    e=n
    ct=0
    while e%a==0:
        if e%d==0:
            ct+=4
            e=e//d
        if e%c==0:
            ct+=3
            e=e//c
        if e%b==0:
            ct+=2
            e=e//b
        if e%a==0:
            ct+=1
            e=e//a
    return ct

t='abcdefghijklmnopqrstuvwxyz'
'''
def ss(s,a):
    return str(a) in str(s)

def solve(__=1):
    for _ in range(__):
        q,d=li()
        a=li()
        for e in a:
            if ss(e,d):
                print("YES")
            else:
                while not ss(e,d) and e>0:
                    e-=d
                yn(e>0)

        



if __name__ == "__main__":
        solve(inp())