Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i* × *j*. The rows and columns are numbered starting from 1.

You are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.
The single line contains numbers *n* and *x* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the size of the table and the number that we are looking for in the table.
t = int(input())
while t != 0:
    t = t - 1
    s = input()
    if len(s) % 2 != 0:
        print("NO")
    else:
        n = len(s)/2
        l1 = s[:int(n)]
        l2 = s[int(n):]
        if l1 == l2:
            
            print("YES")
        else:
            print("NO")