A sequence of integers ( x_{1}, x_{2}, ..., x_{m} ) is an arithmetic sequence if the difference between any two consecutive elements are the same. In other words, x_{i}  x_{i+1} = x_{j}  x_{j+1} for any 1 ≤ i ≤ j < m. By definition, any sequence with less than three integers is also an arithmetic sequence.
Given a sequence of integers a_{1}, a_{2}, ..., a_{n} and Q queries, where each query is one of the following:
For each query of the first type (i), the change is reflected in the original sequence and may affect any future queries. For each query of the second type (ii), you should ouput "YES" or "NO" whether it satisfies the query.
For example, let there be a sequence a_{1..5} = ( 2, 4, 8, 14, 20 ) and 5 queries:
The first line of input contains an integer T (T ≤ 10) denoting the number of cases. Each case begins with two integers N and Q (1 ≤ N, Q ≤ 50,000) denoting the number of integers in the sequence and the number of queries, respectively. The next line contains N integers a_{1}, a_{2}, ..., a_{N} (1 ≤ a_{i} ≤ 1,000,000,000) each separated by a single space, representing the given sequence. The next Q lines represent the queries, where each line is one of the following:
For each case, output in a line "Case #X:" where X is the case number, starts from 1. For each query of the second type (ii), output "YES" or "NO" (without quotes) in a single line whether the query is satisfied.

Explanation for 2^{nd} sample case
The original sequence a_{1..10} = ( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ); and there are 4 queries: