CF756F Long number

Consider the following grammar: - ::= | '+' - ::= | '-' | '(' ')' - ::= | - ::= '0' | - ::= '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' This grammar describes a number in decimal system using the following rules: - describes itself, - - (l-r, $ l

The only line contains a non-empty string at most $ 10^{5} $ characters long which is valid according to the given grammar. In particular, it means that in terms l-r $ l

Print single integer — the number described by the expression modulo $ 10^{9}+7 $ .