import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;


public class A {
	public static void main(String[] args){
			
		
		Scanner in;
		try{
			in=new Scanner(new FileReader("A.in"));
			int T=in.nextInt();
			for(int tt=1;tt<=T;++tt){
				int A=in.nextInt();
				int B=in.nextInt();
				int result=0;
				for (int i=A; i<=B;i++){
					int num=i; //we dont want to loose i!
					int[] dig=new int[7]; //the numbers at a maximum have 7 digits
					ArrayList res=new ArrayList();
					int d=0; //number of digits
					for (int j=0; j<7; j++){
						if (num<=0) dig[j]=-1;
						else {
							dig[j]=num%10;
							d++;
						}
						num/=10;
					}
					for (int j=0; j<d; j++){ // we have a maximum of 7 possible numbers
						num=0;
						int pow=0;
						for (int t=0; t<7;t++){ //generates number with stating point j
							if (dig[(t+j)%7]>=0){
								num+=dig[(t+j)%7]*Math.pow(10, pow);
								pow++;
							}
						}
						if (num>=A && num<=B && num!=i)
							for (int t=0; t<7; t++)
								if (res.contains(num)==false){
									result++; res.add(num);
								}
							
					}
				}
				System.out.println("Case #"+tt+": "+result/2);
			}
		}catch(FileNotFoundException e){
			
		}
		
	}
}
