You are given two integers ~n~ and ~k~, and can perform operations to ~n~.

Each operation allows you to *prepend* a digit ~d~ ~(0 \le 0 \le 9)~ to ~n~,

and it is your task to determine if there exists a sequence of operations such

that ~n~ will end up being divisible by ~k~.

Note: ~n~ and ~k~ can be fairly large with bounds ~(1 \le n, k \le 10^9)~, and

you are required to answer ~t~ test cases.