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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;

/**
 *
 * @author Jason
 */
public class NumberCruncher {
    public NumberCruncher(BufferedReader reader) {
        try {
            FileWriter outFile = new FileWriter(("output.txt"));
            PrintWriter out = new PrintWriter(outFile);
        
            int cases = Integer.parseInt(reader.readLine());
            for(int i=1;i<=cases;i++) {
                String list = reader.readLine();
                String separator = " ";
                ArrayList<String> nums = new ArrayList<String>(Arrays.asList(list.split(separator)));
                int recycled = 0;
                
                //System.out.println(nums.toString());
                HashSet<String> result = new HashSet<String>();
                ArrayList<String> aChars = StringToArrayList(nums.get(0));
                
                //System.out.println("aChars: " + aChars.toString());
                //System.out.println("Value of aChars: " + ValueOfList(aChars));
                
                int A = Integer.parseInt(nums.get(0));
                int B = Integer.parseInt(nums.get(1));
                
                //System.out.println("A: " + A);
                //System.out.println("B: " + B);
                
                while (ValueOfList(aChars) < B) {
                    ArrayList<String> temp = new ArrayList<String>(aChars);
                    //System.out.println("Value of aChars: " + ValueOfList(aChars));
                    
                    for(int j=0;j<(aChars.size()-1);j++) {
                        
                        String tStr = temp.get(aChars.size()-1);
                        temp.remove(aChars.size()-1);
                        temp.add(0, tStr);
                        
                        if(ValueOfList(temp) <= B && ValueOfList(aChars) < ValueOfList(temp) && temp.size() == aChars.size()) {
                            recycled++;
                            String toAdd = ValueOfList(aChars) + "->" + ValueOfList(temp);
                            result.add(toAdd);
                            //System.out.println(ValueOfList(aChars) + "->" + ValueOfList(temp) + " IS RECYCLED!");
                            //System.out.println("IS RECYCLED!");
                        }
                    }
                    
                    aChars = Increment(aChars);
                }
                //System.out.println("Case #"+i+": " + result.size());
                out.println("Case #"+i+": " + result.size());
            }
            out.close();
        }catch(IOException e){System.out.println("Exception!");}
    }
    
    private int ValueOfList(ArrayList<String> l) {
        int sum = 0;
        int digits = l.size();
        for(String str : l) {
            digits--;
            sum += (Integer.parseInt(str) * Math.pow(10, digits));
        }
        return sum;
    }
    
    private ArrayList<String> Increment(ArrayList<String> l) {
        int v = ValueOfList(l);
        v++;
        String s = Integer.toString(v);
        return StringToArrayList(s);
    }
    
    private ArrayList<String> StringToArrayList(String str) {
        ArrayList<String> newArray = new ArrayList<String>();
        
        for(int i=0;i<str.length();i++) {
            char currentChar = str.charAt(i);
            newArray.add(Character.toString(currentChar));
        }
        return newArray;
    }
}
