Karlsson-on-the-Roof

• Kid, let's have some fun.

• Wait, Carlson, I need to do my homework.

• Kid, do you know who is the best homework solver in the world?

• And who is that?

• Kid, it's me! What have you been assigned?!

• The teacher gave me a big number and told me to solve these problems: choose two numbers $l$ and $r$, extract all the digits from the given number between positions $l$ and $r$ inclusive, remove any leading zeros, and check if the resulting number is divisible by $11$.

• Oh, is that all?! I can solve a hundred thousand of such problems in one second.

• But, Carlson, some digits in the number sometimes change.

• That's not a problem, Kid!

In this task, Carlson promised the Kid something he can't deliver. You'll have to help him: write a program that will provide answers to the Kid.

Input

The first line contains a single number of length $N$ ($1\le N\le 10^6$) – the number given to the Kid. Then follows the number $M$ ($1\le M\le 10^5$) – the number of queries. The next $M$ lines contain three numbers each – the type of query, $l$, and $r$. Each query of type one requires you to extract all the digits from positions $l$ to $r$ inclusive (indexing starts from one) and check if the resulting number is divisible by $11$. A query of type two indicates that the digit at position $l$ should be updated to $r$.

Output

For each query of type one, output "Yes" if the number is divisible by $11" and "No" if it is not.

Examples