Large Division

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.

Input

Input starts with an integer T (≤ 525), denoting the number of test cases.

Each case starts with a line containing two integers a (-10200 ≤ a ≤ 10200) and b (|b| > 0, b fits into a 32 bit signed integer). Numbers will not contain leading zeroes.

Output

For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.

Sample Input

6

101 101

0 67

-101 101

7678123668327637674887634 101

11010000000000000000 256

-202202202202000202202202 -101

Sample Output

Case 1: divisible

Case 2: divisible

Case 3: divisible

Case 4: not divisible

Case 5: divisible

Case 6: divisible

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
char s[210];
int main()
{
    int t,b;
    scanf("%d",&t);
    for(int k=1;k<=t;k++)
    {
        getchar();
        scanf("%s",s);
        scanf("%d",&b);
        long long a=0;
        b=fabs(b);
        for(int i=0;i<strlen(s);i++)
        {
            if(s[i]=='-')
                continue;
            a=a*10+s[i]-'0';
            a=a%b;
        }
        printf("Case %d: ",k);
        if(a==0)
            printf("divisible\n");
        else printf("not divisible\n");
    }
    return 0;
}