import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;


public class GCJC {

	static HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();

	public static void main(String[] args) {
		try {
			FileReader in = new FileReader("C-large.in");
			BufferedReader br = new BufferedReader(in);

			File file = new File("./largeC.txt");
			FileWriter fw = new FileWriter(file);

			String line;
			int num = Integer.valueOf(br.readLine());
			int caseNum = 1;

			while ((line = br.readLine()) != null) {

				map = new HashMap<Integer,Integer>();
				StringBuilder sb = new StringBuilder();
				sb.append("Case #" + caseNum + ": ");
				caseNum++;

				int res = 0;
				int a = Integer.valueOf(line.split(" ")[0]);
				int b = Integer.valueOf(line.split(" ")[1]);


				for(int i = a; i <= b ; i++){
					for(int j = 10; j <= i ; j*=10){
						int digit = (int)Math.log10(i) + 1;
						int top = i/j;
						int back = i%j;
						int cycle = (int) (back * Math.pow(10, (digit - (int)Math.log10(j))) + top);
						if(map.get(i) != null && map.get(i) == cycle) continue;
						if(cycle <= b && i < cycle){
							map.put(i, cycle);
							res++;
						}
					}
				}

				sb.append(res);
				fw.write(new String(sb));
				fw.write("\n");
			}

			br.close();
			in.close();
			fw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

}
