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();
	}
}

package com.embege.codejam;

import java.util.Arrays;
import java.util.Scanner;

public class CJ2012QualiCRecycled
{

	static int len(int n)
	{
		int c = 1;
		while ((n = n/10) > 0) c++;
		return c;
	}
	
	static boolean checkDigits(int a, int b)
	{
		if (len(a) != len(b)) return false;
		
		String sa = Integer.toString(a);
		String sb = Integer.toString(b);
		
		char []ca = sa.toCharArray();
		char []cb = sb.toCharArray();
		
		Arrays.sort(ca);
		Arrays.sort(cb);
		int len = ca.length;

		for(int i = 0; i < len; i++)
		  if(cb[i] != ca[i])
		    return false;

		return true;
		/*
		for (int i=0; i<sa.length();++i)
		{
			if (!sb.contains( sa.substring(i,i+1)  )) return false;
			if (!sa.contains( sb.substring(i,i+1)  )) return false;
		}
		
		return true;
		*/
	}
	
	static boolean permut(int a, int b)
	{
		String sa = ""+a;
		String sb = ""+b;
		
		for (int x = 1; x<sa.length()+1; x++)
		{
			String part1 = sa.substring(0, x);
			String part2 = sa.substring(x, sa.length());
			
			String n = part2+part1;
			if (n.equals(sb)) return true;
		}
		return false;
	}
	
	public static void main(String[] args)
	{
		final Scanner in = new Scanner(System.in);
		final int T = in.nextInt();
		for (int t = 0; t < T; t++)
		{
			int A = in.nextInt();
			int B = in.nextInt();			
			int x = 0;
			
			for (int i=A; i<B;++i) 
			{
				for (int j=i+1; j<=B;++j) 
				{
					if (checkDigits(i, j))
					{
						if (permut(i, j))
						{
							x++;
						}
					}
				}
			}
			

			System.out.format("Case #%d: %d\n", (t+1), x );
		}
	}

}
