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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class RecycledNumbers {

	static int t, a, b;
	
	public static void main(String[] args) throws FileNotFoundException {
		Scanner reader = new Scanner(new File("numbers.in"));
		t = reader.nextInt();
		for (int c = 1; c <= t; c++) {
			a = reader.nextInt();
			b = reader.nextInt();
			int cuenta = 0;
			for (int n = a; n < b; n++) {
				cuenta += eval(n);
			}
			System.out.println("Case #"+c+": "+cuenta);
		}
	}
	
	static int eval(int n){
		String s = ""+n;
		int l = s.length();
		int cuenta = 0;
		int nn;
		ArrayList<Integer> nns = new ArrayList<Integer>();
		for (int i = 1; i < l; i++) {
			s = rotar(s);
			if (s.charAt(0)=='0') continue;
			nn = Integer.parseInt(s);
			if (nn>n && nn<=b && !nns.contains(nn)){
				cuenta++;
				nns.add(nn);
			}
		}
		return cuenta;
	}
	
	static String rotar(String s){
		return s.substring(1) + s.charAt(0); 
	}
}
