F - 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<math.h>
#include<string.h>
long long Mod(char a[500],long long b)
{
	long long  ans = 0;//一定要定义成long long
	for (int i=0;a[i]!='\0';i++)
	{
		if (a[i]=='-')	continue;
		ans = (ans * 10 + a[i] - '0') % b;
	}
	return ans%b;
}
int main()
{
	int t;
	char a[500];
	scanf("%d",&t);
	for (int k=1;k<=t;k++)
	{
		long long b;
		memset(a,0,sizeof(a));
		scanf("%s %lld",a,&b);
		b = abs(b);
		printf("Case %d: ",k);
		if (Mod(a,b)==0)
			printf("divisible\n");
		else
			printf("not divisible\n");
	}
	return 0;
}