DBMB had a birthday yesterday. He was gifted an array (a) of (n) elements and a number (x). But there is one problem: he only likes arrays where the sum of the elements equals (s). To make the array appealing to him, you can perform the following operation any number of times: Choose an index (i) ((1 \le i \le n)) and add (x) to the number (a_i). Each test consists of several test cases. The first line contains a single integer (t) ((1 \le t \le 1000)) — the number of test cases. The following describes the test cases. The first line of each test case contains three integers (n), (s), (x) ((1 \le n, x \le 10), (1 \le s \le 100)). The second line of each test case contains (n) integers (a_1, a_2, \dots a_n) ((1 \le a_i \le 10)) — the elements of the array gifted to DBMB. For each test case, output " YES " if the array can appeal to DBMB. Otherwise, output " NO ". You can output each letter in any case (lowercase or uppercase). For example, the strings " yEs ", " yes ", " Yes ", and " YES " will be accepted as a positive answer. In the second test case, (a = 1, 2, 3), applying the operation on (a_2) gives us (a = 1, 4, 3). The sum of the array equals (s).