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.FileReader;
import java.io.IOException;
import java.util.Arrays;

public class Csmall {
    
    private static String move(String n) {
        return n.substring(1) + n.charAt(0);
    }
    
    private static boolean recycled(int n, int m) {
        // Parte 1
        char[] cn = (n + "").toCharArray();
        char[] cm = (m + "").toCharArray();
        Arrays.sort(cn);
        Arrays.sort(cm);
        
        if (!Arrays.equals(cn, cm))
            return false;
        
        // Parte 2
        String cpy = n + "";
        
        while (!(cpy = move(cpy)).equals(n + ""))
            if (Integer.parseInt(cpy) == m)
                return true;
        
        return false;
    }
    
    public static void main(String[] args) {
        BufferedReader br = null;

        try {
            br = new BufferedReader(new FileReader(args[0]));
            
            int s = Integer.parseInt(br.readLine());
            
            for (int i = 0; i != s; ++i) {
                String x = br.readLine();
                String[] tokens = x.split(" ");
                
                int A = Integer.parseInt(tokens[0]);
                int B = Integer.parseInt(tokens[1]);
                int count = 0;
                
                System.out.print("Case #" + (i+1) + ": ");
                
                for (int n = A; n <= B; ++n)
                    for (int m = n + 1; m <= B; ++m)
                        if (recycled(n,m))
                            ++count;
                
                System.out.println(count);
            }

        } catch (IOException e) {
            System.out.println("Error :(");
        } finally {
            
            try {
                if (br != null) br.close();
            } catch (IOException ex) {
                System.out.println("Error :(");
            }
            
        }
    }
}