Migrated from Lutece 1184 the shortest problem

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

In this problem, we should solve an interesting game. At first, we have an integer n, then we begin to make some funny change. We sum up every digit of the n, then insert it to the tail of the number n, then let the new number be the interesting number n. repeat it for t times. When n=123 and t=3 then we can get 123->1236->123612->12361215.

Input

Multiple input. We have two integer n (0<=n<=10^4 ) , t(0<=t<=10^5) in each row. When n==-1 and t==-1 mean the end of input.

Output

For each input , if the final number are divisible by 11, output “Yes”, else output ”No”. without quote.

Samples

35 2
35 1
-1 -1

Case #1: Yes
Case #2: No

Resources

Prepare for 2015 MU2015 Multi-University Training