{"raw_statement":[{"iden":"problem statement","content":"Ringo has a string $S$.\nHe can perform the following $N$ kinds of operations any number of times in any order.\n\n*   Operation $i$: For each of the characters from the $L_i$\\-th through the $R_i$\\-th characters in $S$, replace it with its succeeding letter in the English alphabet. (That is, replace `a` with `b`, replace `b` with `c` and so on.) For `z`, we assume that its succeeding letter is `a`.\n\nRingo loves palindromes and wants to turn $S$ into a palindrome. Determine whether this is possible."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 10^5$\n*   $S$ consists of lowercase English letters.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq L_i \\leq R_i \\leq |S|$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$N$\n$L_1$ $R_1$\n$L_2$ $R_2$\n$:$\n$L_N$ $R_N$"},{"iden":"sample input 1","content":"bixzja\n2\n2 3\n3 6"},{"iden":"sample output 1","content":"YES\n\nFor example, if we perform Operation $1$, $2$ and $1$ in this order, $S$ changes as `bixzja` → `bjyzja` → `bjzakb` → `bkaakb` and becomes a palindrome."},{"iden":"sample input 2","content":"abc\n1\n2 2"},{"iden":"sample output 2","content":"NO"},{"iden":"sample input 3","content":"cassert\n4\n1 2\n3 4\n1 1\n2 2"},{"iden":"sample output 3","content":"YES"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}