{"raw_statement":[{"iden":"statement","content":"Consider the following grammar:\n\n*   _<expression> ::= <term> | <expression> '+' <term>_\n*   _<term> ::= <number> | <number> '-' <number> | <number> '(' <expression> ')'_\n*   _<number> ::= <pos_digit> | <number> <digit>_\n*   _<digit> ::= '0' | <pos_digit>_\n*   _<pos_digit> ::= '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'_\n\nThis grammar describes a number in decimal system using the following rules:\n\n*   _<number>_ describes itself,\n*   _<number>-<number>_ (_l-r_, _l_ ≤ _r_) describes integer which is concatenation of all integers from _l_ to _r_, written without leading zeros. For example, _8-11_ describes _891011_,\n*   _<number>(<expression>)_ describes integer which is concatenation of <number> copies of integer described by _<expression>_,\n*   _<expression>+<term>_ describes integer which is concatenation of integers described by _<expression>_ and _<term>_.\n\nFor example, _2(2-4+1)+2(2(17))_ describes the integer _2341234117171717_.\n\nYou are given an expression in the given grammar. Print the integer described by it modulo 109 + 7."},{"iden":"input","content":"The only line contains a non-empty string at most 105 characters long which is valid according to the given grammar. In particular, it means that in terms _l-r_ _l_ ≤ _r_ holds."},{"iden":"output","content":"Print single integer — the number described by the expression modulo 109 + 7."},{"iden":"examples","content":"Input\n\n8-11\n\nOutput\n\n891011\n\nInput\n\n2(2-4+1)+2(2(17))\n\nOutput\n\n100783079\n\nInput\n\n1234-5678\n\nOutput\n\n745428774\n\nInput\n\n1+2+3+4-5+6+7-9\n\nOutput\n\n123456789"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":null,"simple_statement":null,"has_page_source":false}