시간 제한메모리 제한제출정답맞힌 사람정답 비율
5 초 512 MB866100.000%

## 문제

In this problem, a valid regular expression is one of the following. In the following descriptions, E1, E2, etc. denote (not necessarily different) valid regular expressions.

• A decimal digit: that is, one of 0 1 2 3 4 5 6 7 8 9.
• Concatenation: E1E2.
• Disjunction: (E1|E2 |...|EN), for at least two expressions. Note that the outer parentheses are required.
• Repetition: (E1)*. Note that the outer parentheses are required.

For example, 723(7)*(45)*(1|2|3)((2)*|3)(1|2|3), and ((0|1))* are valid expressions. (7)4|54*(1|), and (0|1)* are not.

We say that an expression E matches a string of digits D if and only if at least one of the following is true:

• E = D.
• E = E1E2 and there exist D1 and D2 such that D = D1D2 and Ei matches Di.
• E = (E1| E2|...| EN) and at least one of the Ei matches D.
• E = (E1)* and there exist D1, D2, ..., DN for some non-negative integer N such that D = D1D2...DN and E1 matches each of the Di. In particular, note that (E1)*matches the empty  string.

For example, the expression ((1|2))*3 matches 313123, and 2221123, among other strings. However, it does not match 1234312312, or 33, among other strings.

Given a valid regular expression R, for how many integers between A and B, inclusive, does R match the integer's base 10 representation (with no leading zeroes)?

## 입력

The first line of the input gives the number of test cases, T. T test cases follow; each consists of two lines. The first line has two positive integers A and B: the inclusive limits of the integer range we are interested in. The second has a string R consisting only of characters in the set 0123456789()|*, which is guaranteed to be a valid regular expression as described in the statement above.

### Limits

• 1 ≤ T ≤ 100.
• 1 ≤ A ≤ B ≤ 1018.
• 1 ≤ length of R ≤ 30.
• R contains no | characters.

## 출력

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the number of integers in the inclusive range [A, B] that the the regular expression R matches.

## 예제 입력 1

8
1 1000
(0)*1(0)*
379009 379009
379009
1 10000
(12)*(34)*
4 5
45
1 100
((0|1))*
1 50
(01|23|45|67|23)
1 1000000000000000000
((0|1|2|3|4|5|6|7|8|9))*
1 1000
1(56|(((7|8))*9)*)


## 예제 출력 1

Case #1: 4
Case #2: 1
Case #3: 5
Case #4: 0
Case #5: 4
Case #6: 2
Case #7: 1000000000000000000
Case #8: 6


## 힌트

Note that sample cases 5 through 8 would not appear in the Small dataset.

In sample case 1, the matches in range are 1, 10, 100, and 1000.

In sample case 2, the match in range is 379009.

In sample case 3, the matches in range are 12, 34, 1212, 1234, and 3434.

In sample case 4, there are no matches in range.

In sample case 5, the matches in range are 1, 10, 11, and 100.

In sample case 6, the matches in range are 23 and 45.

In sample case 7, it is possible to form any number in the range.

In sample case 8, the matches in range are 1, 19, 156, 179, 189, and 199.

## 채점 및 기타 정보

• 예제는 채점하지 않는다.