Once Kazama had written a basic calculator, he read further about other operators and operator precedence. Now he is writing a new calculator with following details:

• Binary addition: .
• Binary subtraction:
• Multiplication:
• Division:
• Unary operators: and
• Brackets:

Operator precedence

Associativity

Now all operators are right associative. That is , or

Formally it has following grammar:

 Expression ::= Term [+-] Expression
              | Term

 Term       ::= Factor [*/] Term
              | Factor

 Factor     ::= Number
              | [+-] Factor
              | '(' Expression ')'

He needs your help to verify it. He wants you to solve some expressions for him using the above grammar and he will cross check the results. Since you are also lazy, you will write another computer program which will solve the expressions. Since the output value can be too large, you have to tell output modulo .

Note:

• is a prime.