The shortest problem

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.

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.

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

35 2
35 1
-1 -1

Case #1: Yes
Case #2: No 

UESTC

2015 Multi-University Training Contest 7