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

public class ProbC
{
	public static void main(String[] args) throws FileNotFoundException, IOException
	{
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		int times = Integer.parseInt(br.readLine());
		BufferedWriter wr = new BufferedWriter(new FileWriter("C-small-attempt0soln.in"));
		for (int i = 0; i < times; i++)
		{
			String sentence = br.readLine();
			String[] nums = sentence.split(" ");
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			int recycledPairs = 0;
			ArrayList<Integer> firstIncluded = new ArrayList<Integer>();
			ArrayList<Integer> secondIncluded = new ArrayList<Integer>();

			for (int currNum = a; currNum <= b; currNum++)
			{
				if (!firstIncluded.contains(currNum))
				{
					boolean currNumAdded = false;
					String currNumString = currNum + "";

					int digits = currNumString.length();
					for (int x = 0; x < digits; x++)
					{
						currNumString = currNumString.substring(currNumString.length() - 1) + currNumString.substring(0, currNumString.length() - 1);

						int currNumCheck = Integer.parseInt(currNumString);
						if (currNumCheck >= a && currNumCheck <= b && !(firstIncluded.contains(currNum) && secondIncluded.get(firstIncluded.indexOf(currNum)).equals(currNumCheck)) && !(secondIncluded.contains(currNumCheck) && firstIncluded.get(secondIncluded.indexOf(currNumCheck)).equals(currNum)) && currNumCheck != currNum)
						{
							secondIncluded.add(currNumCheck);
							recycledPairs++;
							//if (!currNumAdded)
							//{
								firstIncluded.add(currNum);
							//	currNumAdded = true;
						//	}
						//	System.out.println("(" + currNum + ", " + currNumString + ")");
						}
						/*else
						{
							if (currNumCheck >= a && currNumCheck <= b && currNumCheck != currNum) //&& !numsAlreadyIncluded.contains(currNumCheck) && currNumCheck != currNum)
								System.out.println("(" + currNum + ", " + currNumCheck + ")");
						}*/
					}
				}
			}
			recycledPairs /= 2;
			wr.write("Case #" + (i+1) + ": " + recycledPairs);
			wr.newLine();
		}
		wr.close();
	}
}