CEQU  Crucial Equation
Let us see the following equation,
ax+by=c
Given three positive integers a, b and c. You have to determine whether there exists at least one solution for some integers value of x and y where x, y may be negative or nonnegative integers.
For example if a=2, b=4 and c=8 then the equation will be 2x+4y=8, and hence, for x=2 and y=1, there exists a solution.
Let us see another example for a=3, b=6 and c=7, so the equation will become 3x+6y=7 and there exists no solution satisfying this equation.
Input
Input starts with an integer T (1<=T<=10^{5}) denoting the number of test cases. Each test case contains three integers a, b, and c. (1<=a, b, c<=10^{6}).
Output
For each test case of input print the case number and “Yes” if there exists at least one solution, print “No” otherwise.
Sample Input 
Output for Sample Input 
2 
Case 1: Yes 
Problem Setter: Md Abdul Alim, CEO and Founder at CodeMask
hide comments
cubalgo:
20160807 01:30:15
note space between : and Yes/No . 

shashisuman:
20160708 00:50:13
question is wrong


siddharth_0196:
20160611 12:13:46
easy. :) 

mkfeuhrer:
20160608 12:50:22
hell to output format.....WA for dat ...take care .... easy othrwise :) 

Sarthak Munshi:
20160604 12:39:52
3 lines in python ! 

ashiq_iqbal:
20160407 10:12:01
I think you should familiar with diophantine equation to solve this problem :) 

try2catch:
20160324 05:12:54
OMG! Java took 3.2s O_o 

sharath_111:
20160130 19:09:00
good one in basics...take care of output format cost me WA.. :)


crazy_coder97:
20160117 20:17:34
output format costed me 3 wa :( Last edit: 20160117 20:21:49 

rocode0001:
20151223 11:37:27
Output format costed me 1 wrng ans!!!...be careful 
Added by:  Md Abdul Alim 
Date:  20141015 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU 
Resource:  Own Problem 