B. Nezzar and Lucky Number

B. Nezzar and Lucky Number
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
Nezzar’s favorite digit among 1,…,9 is d. He calls a positive integer lucky if d occurs at least once in its decimal representation.

Given q integers a1,a2,…,aq, for each 1≤i≤q Nezzar would like to know if ai can be equal to a sum of several (one or more) lucky numbers.

Input
The first line contains a single integer t (1≤t≤9) — the number of test cases.

The first line of each test case contains two integers q and d (1≤q≤104, 1≤d≤9).

The second line of each test case contains q integers a1,a2,…,aq (1≤ai≤109).

Output
For each integer in each test case, print “YES” in a single line if ai can be equal to a sum of lucky numbers. Otherwise, print “NO”.

You can print letters in any case (upper or lower).

Example
inputCopy
2
3 7
24 25 27
10 7
51 52 53 54 55 56 57 58 59 60
outputCopy
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
NO
Note
In the first test case, 24=17+7, 27 itself is a lucky number, 25 cannot be equal to a sum of lucky numbers.

只要各个数位上有d即是幸运数字，当d=3时，13，31，331都是幸运数字，于是稍加思考便可得知：

1.  ai>=10*d 都是两个幸运数字之和
   

2.  (ai-j*d)%10==0 （1<=j<10）是两个幸运数字之和或幸运数字
   

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int T,x,n,d;
	cin>>T;
	while (T--)
	{
		cin>>n>>d;
		for (int i=1;i<=n;i++) 
		{
			cin>>x;
			if (x>=10*d) cout<<"YES"<<endl;
			else 
			{
				int w=1;
				for (int j=1;j<10;j++)
				{
					int s=x-j*d;
					if (s<0) break;
					else if (s%10==0)
					{
						w=0;
						cout<<"YES"<<endl;
						break;
					 } 
					
				}
				if (w) cout<<"NO"<<endl;
			}
		}
	}
}