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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class C {
	private static final String PROBLEM_NAME = "C-large";

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader r = new BufferedReader(new FileReader(PROBLEM_NAME + ".in"));
		BufferedWriter w = new BufferedWriter(new FileWriter(PROBLEM_NAME + ".out"));
		int testsNumber = Integer.parseInt(r.readLine());
		for (int i = 0; i < testsNumber; ++i) {
			String[] line = r.readLine().split(" ");
			int a = Integer.parseInt(line[0]);
			int b = Integer.parseInt(line[1]);
			long res = 0L;
			
			int len = 0;
			int tmp = a;
			while (tmp != 0) {
				++len;
				tmp /= 10;
			}
			if (a == 0) {
				len = 1;
			}
			
			int m = 1;
			for (int j = 1; j < len; ++j) {
				m *= 10;
			}
			
			while (a < b) {
				Set<Integer> counted = new HashSet<Integer>();
				int t = a;
				boolean sh = false;
				for (int j = 1; j < len; ++j) {
					int x = t % 10;
					if (x == 0) {
						sh = true;
						t = t / 10;
					} else {
						sh = false;
						t = x * m + t / 10;
					}
					if (!sh && t <= b && t > a && !counted.contains(t)) {
						counted.add(t);
						++res;
					}
				}
				++a;
			}
			
			w.write("Case #" + (i + 1) + ": ");
			w.write(res + "");
			w.newLine();
		}
		r.close();
		w.close();
	}
}
