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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/**
 *
 * @author Mody
 */
public class c {

    public static void main(String[] args) throws FileNotFoundException, IOException {
//        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
        FileWriter out= new FileWriter("sol.out");
        int t = Integer.parseInt(in.readLine());
        StringTokenizer st;
        int a, b ;
        int ret=0;
        String s1="",s2="";
        for (int i = 0; i < t; i++) {
            st=new StringTokenizer(in.readLine());
            a=Integer.parseInt(st.nextToken());
            b=Integer.parseInt(st.nextToken());
            ret=0;
            for (int j = a; j <=b; j++) {
                for (int k = j+1; k <=b; k++) {
                    s1=j+"";
                    s2=k+"";
                    
                    if(s1.length()!=s2.length())
                        break;
                    
                        ret+=is(s1,s2);
                    
                        
                }
            }
            out.write("Case #"+(i+1)+": "+ret);
            if(i!=t-1)
                out.write("\n");
        }
        out.close();


    }
   private static int is(String s1, String s2) {
        String s,ss;
        if(s1.length()==2)
            if(s1.charAt(0)==s2.charAt(1)&&s1.charAt(1)==s2.charAt(0))
                return 1;
        for (int i = 1; i < s1.length(); i++) {
            s=s1.substring(0,i);
            ss=s1.substring(i,s1.length());
           if(!s.equals("")&&!ss.equals(""))
            if(s2.endsWith(s)&&s2.startsWith(ss)){
                return 1;
            }
        }
        return 0;
    }
}
