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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

public class Recycle {

	public static void main(String[] args) {
		new Recycle().readFile();
	}

	private void readFile() {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(
					"input.txt"));
			maxCases = Integer.parseInt(reader.readLine());
			for (int i = 1; i <= maxCases; i++) {
				String singleCase = reader.readLine();
				solve(singleCase);
				System.out.println("Case #" + i + ": " + (counter-sym));
				clear();
			}

		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	private void clear() {
		counter =sym=0;
	}

	private int maxCases;
	int counter, min, max,sym;

	private void solve(String singleCase) {
		String vals[] = singleCase.split(" ");
		min = Integer.parseInt(vals[0]);
		max = Integer.parseInt(vals[1]);
		for (int i = min; i <= max; i++) {
			for (int j = 1; j < (i + "").length(); j++) {
				int rev = permuteNumber(i + "", j);
				if (rev <= max && rev >= i && checkRev(i) && i!=rev) {
					if(checkSymmetry(i))
						sym++;
					counter++;
				}
			}
		}
		sym = sym/2;
	}

	private boolean checkRev(int i) {
		char ch[] = (i + "").toCharArray();
		for (char c : ch) {
			if (ch[0] == c) {
				continue;
			} else {
				return true;
			}
		}
		return false;
	}

	public int permuteNumber(String st, int pos) {
		String s = st.substring(st.length() - pos)
				+ st.substring(0, st.length() - pos);
		return Integer.parseInt(s);
	}
	private boolean checkSymmetry(int i){
		String s =(i+"");
		if(s.substring(0,s.length()/2).equals(s.substring(s.length()/2))){
			return true;
		} else{
			return false;
		}
	}
}
