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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class Solution {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public void doMain() throws Exception {

		Scanner sc = new Scanner(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));

		int caseCnt = sc.nextInt();
		sc.nextLine();
		for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
			pw.print("Case #" + (caseNum + 1) + ": ");
			//# A
			int a = sc.nextInt();
			//# B
			int b = sc.nextInt();
			
			int res = 0;
			for (int i = a; i<b; i++) {
				for (int j = i+1; j<=b ; j++) {
					if(recycledPairs(i, j, a, b)) {
						res++;
					}
				}
			}
			pw.println(res);
		}


		pw.flush();
		pw.close();
		sc.close();
	}
	
	public boolean recycledPairs(int n, int m, int a, int b) {
		boolean result = false;
		String initial = ""+n;
		String expected = ""+m;
		
		for (int i=1; i<initial.length(); i++) {
			if (expected.equals(initial.substring(i,initial.length())+initial.substring(0,i))) {
				result = true;
			}
		}
		
//		System.out.println(n+" "+m+ " "+result);
		return result;
	}

	public static void main(String[] args) throws Exception {
//		System.out.println((int)'a');
		new Solution().doMain();
	}
}
