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.*;
import java.util.*;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			Scanner in = new Scanner(new File("C:/Users/Ross/Downloads/C-large.in"));
			int T = in.nextInt();
			String out = "";
			for(int i = 0; i < T; i++) {
				int A = in.nextInt();
				int B = in.nextInt();
				int count = 0;
				for(int j = A; j < B; j++) {
					String num = Integer.toString(j);
					ArrayList<Integer> pairs = new ArrayList<Integer>();
					for(int k = 1; k < num.length(); k++) {
						String num2 = num.substring(num.length()-k,num.length())+num.substring(0,num.length()-k);
						int nnum = Integer.parseInt(num2);
						if(nnum > j && nnum <= B && Integer.toString(nnum).length()==num.length()){
							if(pairs.indexOf(nnum) == -1) {
								count++;
								pairs.add(nnum);
							}
						}
					}
				}
				out += "Case #" + (i+1) + ": ";
				out += count + "\n";
			}
			System.out.println(out);
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}
}
