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 ProblemC {
	public static void main(String[] args) {
		try {
			Set<Integer> alltuples = new HashSet<Integer>();

			PrintWriter fout = new PrintWriter(new FileWriter("CJ"));
			BufferedReader fin = new BufferedReader(new FileReader("C-large.in"));

			String l;
			String[] p;
			Integer i, j, k, m, n, ans,tests = Integer.valueOf(fin.readLine());
			for(i = 1; i <= tests; ++i) {
				ans = 0;
				p = fin.readLine().split(" ");
				j = Integer.valueOf(p[0]);
				k = Integer.valueOf(p[1]);
				for(j = j; j < k; ++j) {
					alltuples.clear();
					l = j.toString();
					for(m = 1; m < l.length(); ++m) {
						n = Integer.valueOf(l.substring(m) + l.substring(0,m));
						if(n > j && n <= k)
							alltuples.add(n);
					}
					ans += alltuples.size();
				}
				fout.println("Case #" + i +": " + ans);
			}

			fin.close();
			fout.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
