##
1999-2000 ACM Northeastern European Regional Programming Contest

###
Problem A

"Divisibility"

Consider an arbitrary sequence of integers. One can place + or - operators
between integers in the sequence, thus deriving different arithmetical
expressions that evaluate to different values. Let us, for example, take
the sequence: 17, 5, -21, 15. There are eight possibilities that result:
17 |
+ |
5 |
+ |
-21 |
+ |
15 |
= |
16 |

17 |
+ |
5 |
+ |
-21 |
- |
15 |
= |
-14 |

17 |
+ |
5 |
- |
-21 |
+ |
15 |
= |
58 |

17 |
+ |
5 |
- |
-21 |
- |
15 |
= |
28 |

17 |
- |
5 |
+ |
-21 |
+ |
15 |
= |
6 |

17 |
- |
5 |
+ |
-21 |
- |
15 |
= |
-24 |

17 |
- |
5 |
- |
-21 |
+ |
15 |
= |
48 |

17 |
- |
5 |
- |
-21 |
- |
15 |
= |
18 |

We call the sequence of integers **divisible** by *K* if + or
- operators can be placed between integers in the sequence in such way
that resulting value is divisible by *K*. In the above example, the
sequence is divisible by 7 (because 17+5+-21-15=-14), but the sequence
is not divisible by 5.

You are to write a program that will determine divisibility of sequence
of integers.

###
Input

The first line of the input file contains the number of tests present in
the file.
For each test present, subsequent lines of the input file alternate
between

Containing two integers, *N* and *K* (1 <= *N*
<= 10000, 2 <= *K* <= 100) separated by a space, and

Containing a sequence of *N* integers separated by spaces. Each
integer is less than 10001 in absolute value.

###
Output

For each test, your program should output the word "Divisible" if the given
sequence of N integers is divisible by *K* or "Not divisible" if
not.
###
Sample input

2
4 7
17 5 -21 15
4 5
17 5 -21 15

###
Sample Output

Divisible
Not divisible