SUB2015-H

#include <stdio.h>
#include <math.h>
int main()
{
    int T,cnt=1;
    long long int mod =  1000000007;
    scanf("%d",&T);
    while (T--) {
        long long int a,b;
        scanf("%lld%lld",&a,&b);

        int i,k;
        long long int sum = 0;

        long long int ara[20];

        for (k=a;k<=b;k++) {
            long long int mul = 1;
            int z =k;
            int length = floor(log10(z)) +1;
            for (i=0;i < length;i++) {
                if (z == 1) {
                    break;
                }
                ara[i] = z % 10;
                z = z/10;
                mul = (mul * ara[i]) % mod ;
            }
            sum = (sum + mul) % mod  ;

        }
        printf("Case %d: %lld\n",cnt, sum );
        cnt++;

    }
    return 0;
}