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.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;


public class ProblemC {
	public static void main(String [] args){
		doIt();
	}

	public static void doIt(){

		try{
			BufferedWriter out = new BufferedWriter(new FileWriter("C-small-attempt0.out"));
			FileInputStream fstream = new FileInputStream(new File("C-small-attempt0.in"));
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int testLines = Integer.parseInt(br.readLine());
			int caseCounter = 0;
			while ((strLine = br.readLine()) != null) {
				int possibs = 0;
				String[] str = strLine.split(" ");
				List<Integer> numbers = new ArrayList<Integer>();
				int  small = Integer.parseInt(str[0]);
				int  large = Integer.parseInt(str[1]);
				System.out.println(small + " " + large);
				for (int i = small ; i <= large ; i++){
					numbers.add(i);
				}
				for(int n : numbers){
					int len = String.valueOf(n).length();
					if (len == 1) continue;
					if (len == 2 && (String.valueOf(n)).substring(1, 2) != "0") {
						String strN = (String.valueOf(n)).substring(1, 2) + (String.valueOf(n)).substring(0, 1);
						System.out.println(strN);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large){
							possibs++;
						}
					}
					else if (len == 3) {
						String strN = (String.valueOf(n)).substring(2, 3) + (String.valueOf(n)).substring(0, 2);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large && (String.valueOf(n)).substring(2, 3) != "0"){
							possibs++;
						}
						String strNN = (String.valueOf(n)).substring(1, 3) + (String.valueOf(n)).substring(0, 1);
						if (n < Integer.parseInt(strNN) && Integer.parseInt(strNN) <= large && (String.valueOf(n)).substring(1, 2) != "0"){
							possibs++;
						}
					}
					else if (len == 4) {
						String strN = (String.valueOf(n)).substring(3, 4) + (String.valueOf(n)).substring(0, 3);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large && (String.valueOf(n)).substring(3, 4) != "0"){
							possibs++;
						}
						String strNN = (String.valueOf(n)).substring(2, 4) + (String.valueOf(n)).substring(0, 2);
						if (n < Integer.parseInt(strNN) && Integer.parseInt(strNN) <= large && (String.valueOf(n)).substring(2, 3) != "0"){
							possibs++;
						}
						String strNNN = (String.valueOf(n)).substring(1, 4) + (String.valueOf(n)).substring(0, 1);
						if (n < Integer.parseInt(strNNN) && Integer.parseInt(strNNN) <= large && (String.valueOf(n)).substring(1, 2) != "0"){
							possibs++;
						}
					}
				}
				System.out.println(possibs);
				caseCounter++;
				out.write("Case #" + caseCounter + ": " + possibs);
				out.newLine();
			}
			in.close();
			out.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
}
