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.IOException;
import java.text.NumberFormat;
import java.util.List;

public class Welcome extends JamProblem {

    String welc = "welcome to code jam";

    public static void main(String[] args) throws IOException {
        Welcome p = new Welcome();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        WelcomeCase cas = (WelcomeCase) jamCase;
        int length = welc.length();
        int strL = cas.str.length();
        String str = cas.str;

        int[][] tab = new int[length][strL];
        for (int i = length - 1; i >= 0; i--) {
            char c = welc.charAt(i);
            for (int j = strL - 1; j >= 0; j--) {
                if (i == length - 1) {
                    if (j == strL - 1) {
                        tab[i][j] = str.charAt(j) == c ? 1 : 0;
                    } else {
                        tab[i][j] = mod(tab[i][j + 1] + (str.charAt(j) == c ? 1 : 0));
                    }
                } else {
                    if (j == strL - 1) {
                        tab[i][j] = 0;
                    } else {
                        tab[i][j] = mod(tab[i][j + 1] + (str.charAt(j) == c ? 1 : 0) * tab[i + 1][j]);
                    }
                }
            }
        }
        NumberFormat nf = NumberFormat.getInstance(); // Get Instance of NumberFormat
        nf.setMinimumIntegerDigits(4); // The minimum Digits required is 5
        nf.setMaximumIntegerDigits(4); // The maximum Digits required is 5
        nf.setGroupingUsed(false);
        return nf.format(tab[0][0]);  //To change body of implemented methods use File | Settings | File Templates.
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        WelcomeCase cas = new WelcomeCase();
        cas.lineCount = 1;
        cas.str = file.get(line);
        return cas;
    }

    int mod(int i) {
        return i % 10000;
    }
}

class WelcomeCase extends JamCase {
    String str;
}
