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

}

package numbers;

import java.util.*;
import java.io.*;

public class Numbers {
     public static void main(String[] args) throws Exception {
       Scanner br = new Scanner(new FileReader("C-small-attempt0.in"));
       BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
       
       int T = br.nextInt();
       
       for(int t = 1; t<=T; t++){
           int A = br.nextInt();
           int B = br.nextInt();
           
           int sum = 0;
           for(int i = A; i < B; i++){
                 sum += pcount(i, B);
           }
           bw.write("Case #"+t+": "+sum);
           bw.newLine();
       }
                
       br.close();
       bw.close();
    }
     
    private static int pcount(int n, int max){
        if(n<10) return 0;
        
        int sum = 0;
        String r = rev(Integer.toString(n));
        String sn = Integer.toString(n);
        
        while(!r.equals(sn)){
            int ir = Integer.parseInt(r);
            if(ir>n && ir<=max){
                sum++;
            }
            r = rev(r);
        }
        return sum;
    }
    
    private static String rev(String n){
        if(n.length()<2) return n;

        StringBuilder sb = new StringBuilder();
        sb.append(n.charAt(n.length()-1));
        for(int i = 0; i< n.length()-1; i++){
            sb.append(n.charAt(i));
        }        

        return sb.toString();
    } 
}
