CHAPD May Challenge weak testcases

I think that the testcases for the problem CHAPD(Chef and Prime Divisors ) are very weak.
I have got an AC, but my solution gives “No” for input: 10007 100140049 ,but the answer should be “Yes” since 100140049 = 10007*10007 and 10007 is a prime divisor of 100140049 and it also divides 10007,
So shouldn’t be the answer “Yes” for this input??
Correct me if I am wrong and if this question is against the rules of Codechef, then I will close this question.
Thank you

I think you should email the codechef rather than posting a test case here.
Posting a test case with answer is against the rules(during the contest).