Nezzar and Lucky Number

题意翻译

给定正整数 $d(1\le d\le 9)$，如果正整数 $k$ 的十进制表示中含有数码 $d$，我们就把 $k$ 称为“幸运数”。 现在，给你一个长度为 $q(1\le q\le 10^{4})$ 的数组 $a_{1},a_{2},…,a_{q}(1\le a_{i}\le 10^{9})$，请依次判断数组的每个元素能否表示为若干个“幸运数”之和的形式，如果能，输出 `YES`，否则输出 `NO`。 你需要回答 $t(1\le t\le 9)$ 组独立的测试用例。 翻译 by vectorwyx

题目描述

Nezzar's favorite digit among $ 1,\ldots,9 $ is $ d $ . He calls a positive integer lucky if $ d $ occurs at least once in its decimal representation. Given $ q $ integers $ a_1,a_2,\ldots,a_q $ , for each $ 1 \le i \le q $ Nezzar would like to know if $ a_i $ can be equal to a sum of several (one or more) lucky numbers.

输入输出格式

输入格式

The first line contains a single integer $ t $ ( $ 1 \le t \le 9 $ ) — the number of test cases. The first line of each test case contains two integers $ q $ and $ d $ ( $ 1 \le q \le 10^4 $ , $ 1 \le d \le 9 $ ). The second line of each test case contains $ q $ integers $ a_1,a_2,\ldots,a_q $ ( $ 1 \le a_i \le 10^9 $ ).

输出格式

For each integer in each test case, print "YES" in a single line if $ a_i $ can be equal to a sum of lucky numbers. Otherwise, print "NO". You can print letters in any case (upper or lower).

输入输出样例

输入样例 #1

2
3 7
24 25 27
10 7
51 52 53 54 55 56 57 58 59 60

输出样例 #1

YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
NO

说明

In the first test case, $ 24 = 17 + 7 $ , $ 27 $ itself is a lucky number, $ 25 $ cannot be equal to a sum of lucky numbers.