Let \(S(X)\) be a function with variable \(X\), it can be represented by the formula as \(S(X)= \sum_{j=1}^X f(j) \), where \(f(x)\) consists of one or more functions in function set \(F=\{C, C/x, Csinx, Ccosx, C/sinx, C/cosx, C^x, Cx\}\) with C is a constant integer ranging from 0 to 10⁹.

The 1st line of input contains a single integer \(t \ (1 \leq t \leq 10^4)\), the number of test cases.

There is a string \(s (1 \leq |s| \leq 100)\) in each line of the rest t lines.

String s indicates the formula of \(f(x)\). Fraction is presented as \(a/b\). C^x is presented as C^x. Note that the constant C will not be omitted when C=1. Two adjacent functions in \(f(x)\) are connected by +.

For each test case, print "yes"(without quotes) in a line if \(S(X)\) is convergent, otherwise print "no".

we say \(S(X)\) is convergent if \(\lim_{X \rightarrow \infty} S(X)=A\)