import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	private static final String fname = "C-small-attempt0.in";

	public static void main(String[] args) throws Exception {
		new RecycledNumbers().run();
	}
	
	private void run() throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader("./" + fname));
		BufferedWriter writer = new BufferedWriter(new FileWriter("./" + fname
				+ ".out"));
		int T = Integer.parseInt(reader.readLine().trim());
		for (int i = 1; i <= T; i++) {
			String[] line = reader.readLine().trim().split("[ ]");
			int lower = Integer.parseInt(line[0]);
			int upper = Integer.parseInt(line[1]);
			int retval =0;
			for (int j = lower ; j <= upper; j++) {
					Set<Integer> set = new HashSet<Integer>(2);
					int l = length10(j);
					int mult = l/10;
					for (int k = 10; k <= l; k = k*10) {
						int x = (j % k) * mult + (j / k);
						if (x >= lower && x <= upper && x != j && j < x  && !set.contains(x)) {
							set.add(x);
							retval++;
						}
						mult /=10;
					}
			}
			writer.write("Case #" + i + ": " + retval);
			if (i < T) writer.write("\n");
		}
		reader.close();
		writer.close();
	}

	private static int length10(int n) {
		int div = 1;
		while (n / div > 0) {
			div *= 10;
		}
		return div;
	}
}
