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.HashSet;
import java.util.List;
import java.util.Set;


public class RecycledNumbers {

	public static void main(String[] args){
		List<Integer> res = new ArrayList<Integer>();
		try {
			FileInputStream fstream = new FileInputStream("C-small-attempt0 (1).in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			int cases = Integer.valueOf(br.readLine());
			for(int i = 0; i < cases; i++) {
				String line = br.readLine();
				int min = Integer.valueOf(line.split("[ \r\n\t]+")[0]);
				int max = Integer.valueOf(line.split("[ \r\n\t]+")[1]);
				res.add(solve(min, max));
			}
			in.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}
		
		try {
			// Create file
			File fout = new File("out.txt");
			FileWriter fstream = new FileWriter(fout);
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i = 0; i < res.size(); i++){
				out.write("Case #" + (i+1) + ": " + res.get(i)); 
				out.newLine();
			}
			// Close the output stream
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}

	}
	
	static int solve(int min, int max){
		//find number of digits
		int tmp = min;
		int size = 0;
		while(tmp > 0){
			tmp /= 10;
			size++;
		}
		if(size == 1)
			return 0;
		int res = 0;
		for(int i = min; i <= max; i++){
			int[] digits = toDigits(i, size);
			Set<Integer> candidates = asNumbers(digits);
			for(int candidate : candidates){
				if(candidate > i && candidate >= min && candidate <= max)
					res++;
			}
		}
		return res;
	}
	
	static int[] toDigits(int i, int size){
		int[] res = new int[size];
		int counter = size-1;
		while(i > 0){
			res[counter--] = i%10;
			i /= 10;
		}
		return res;
	}
	
	static Set<Integer> asNumbers(int[] digits){
		Set<Integer> res = new HashSet<Integer>();
		int tmp = 0;
		for(int i = 0; i < digits.length; i++){
			tmp *= 10;
			tmp += digits[i];
		}
		for(int i = 0; i < digits.length-1; i++){
			int mod = tmp%10;
			tmp /= 10;
			for(int j = 0; j < digits.length-1; j++){
				mod *= 10;
			}
			tmp += mod;
			res.add(tmp);
		}
		return res;
	}
	
}
