Problem Description

During 2010 summer training, temperlisyer often does problem like this:
“Consider a decimal integer as sequence of digits {D₀, D₁ … D_n-1} (D₀ > 0), if exists such x, y and z, satisfying:
1.D_i-1<D_i (0<i<=x)
2.D_i-1=D_i (x<i<=y)
3.D_i-1<D_i (y<i<=z)
4.D_i-1>D_i (z<i<=n-1)

We call this integer “Lanlanshu”, now give you two numbers A and B, calculate how many “Lanlanshu” are in [A, B].“
He solved so many of these and finally get bored, and then get crazy! He decided to make up a problem to put this type of problems to an end.
Give you a string str consists only by ‘/’, ‘-‘ and ‘\’, and its length is l. Consider a decimal integer as sequence of digits {D₀, D₁ … D_n-1} (D0 > 0), define x₀=0, x_l=n-1, if exists such x₁, x₂...x_l (x₀ < x₁ < x₂ < ... < x_l) satisfying:
1. If str[i]=’/’, D_j-1<D_j (x_i<j<=x_i+1)
2. If str[i]=’-’, D_j-1=D_j (x_i<j<=x_i+1)
3. If str[i]=’\’, D_j-1>D_j (x_i<j<=x_i+1)

We call it Final Kichiku “Lanlanshu”, now give you two numbers A and B, calculate how many Final Kichiku “Lanlanshu” are in [A, B]. This number maybe huge, we only want to now the last 8 digits of the result.

Input

Multiple cases (no more than 100), for each case:
The first line is string str, length is below 100.
The second line contains two integers A and B (0≤Ai≤Bi≤10^100).
Input terminates by EOF.

Output

For each case, output 8 digits representing the last 8 digits of the number of Final Kichiku “Lanlanshu” in [A, B]. If it’s less than 8 digits, fill it with leading zeros.

/\
01221 2012

00000315

Author

temperlsyer