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.*;

/*
 * To change this template, choose Tools | Templates and open the template in
 * the editor.
 */
/**
 * Problem C. Recycled Numbers
 *
 * @author admin
 */
public class ProblemC_RecycledNumbers {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("c:/C-small-attempt0.in")));

        br.readLine();  // Ignore T

        StringBuilder sb = new StringBuilder();
        int row = 1;

        for (String line = br.readLine(); line != null; line = br.readLine()) {
            sb.append("Case #");
            sb.append(row);
            sb.append(": ");
            int ret = 0;
            String[] numbers = line.split(" ");
            int A = Integer.parseInt(numbers[0]);
            int B = Integer.parseInt(numbers[1]);
            
            for (int m = A+1; m <= B; m++) {
                for (int n = A; n < m; n++) {
                    if(recycled(n, m)) {
                        ret++;
                    }
                }
            }
            
            sb.append(ret);
            System.out.println(ret);
            sb.append('\n');
            row++;
        }
        
        File file=new File("ProblemC_RecycledNumbers.out");
        DataOutputStream output=new DataOutputStream(new FileOutputStream(file));
        output.write(sb.toString().getBytes());
        output.close();

    }

    public static boolean recycled(int n, int m) {
        
        String strN = String.valueOf(n);
        String strM = String.valueOf(m);
        
        for(int i=1; i<strN.length(); i++) {
            String temp = strN.substring(i) + strN.substring(0, i);
            
            if(strM.equals(temp)) {
                return true;
            }
        }

        return false;
    }
}
