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;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package googlecodejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.Writer;

/**
 *
 * @author rerngrak
 */
public class RecycledNumber {
    public static void main(String[] args) throws Exception {
        File input = new File("src/googlecodejam/C-small-attempt0.in");
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(input)));

        //first line for number of line
        long row = Long.valueOf(reader.readLine());

        File file = new File("output.txt");
        Writer writer = new BufferedWriter(new FileWriter(file));

        

        for (long l=1;l<=row;l++){
            String line = reader.readLine();

            String in[] = line.split(" ");
            
            long m = Long.valueOf(in[0]);
            long n = Long.valueOf(in[1]);
            
            int counter = 0;
            for (long i=m;i<=n;i++){
                char[] ab = String.valueOf(i).toCharArray();
                if (ab.length == 1){
                    continue;
                }else if (ab.length == 2){
                    String x = new String(""+ab[0]);
                    String y = new String(""+ab[1]);
                    if (!x.equals(y) && !y.equals("0")){
                        
                        long swap = new Long(y+x).longValue();
                        if (swap > i && swap <= n) {
                            counter++;
                            continue;
                        }
                    }
                    
                }else if (ab.length == 3){
                    String x = new String(""+ab[0]);
                    String y = new String(""+ab[1]);
                    String xy = x.concat(y);
                    String z = new String(""+ab[2]);
                    String yz = y.concat(z);

                    if (!xy.equals(yz) && !yz.equals("00")){
                        
                        long swap2 = new Long(z.concat(xy)).longValue();
                        if (swap2 > i && swap2 <= n){
                            counter++;
                            
                        }
                        long swap1 = new Long(yz.concat(x)).longValue();
                        if (swap1 > i && swap1 <= n){
                            counter++;
                            
                        }
                        continue;
                    } 
                }else if (ab.length == 4){
                    String a = new String(""+ab[0]);
                    String b = new String(""+ab[1]);
                    String c = new String(""+ab[2]);
                    String d = new String(""+ab[3]);
                    counter = 287;

                }
            }

            System.out.println("Case #"+l+": "+counter);
            String writeout = "Case #"+l+": "+counter +"\n";
            writer.write(writeout);
            
        }
        reader.close();
        writer.close();
       
    }
    

}
