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 recycle
{	
	public static void main(String[] args) throws Exception
	{
		int cases;
		BufferedReader in=new BufferedReader(new FileReader("input.in"));
		PrintWriter out=new PrintWriter(new BufferedWriter(new FileWriter("recycle.out")));
		cases=Integer.parseInt(in.readLine());
		int numPairs=0;
		
		for (int k=0; k<cases; k++)
		{
			numPairs=0;
			String a,b;
			int left, right;
			StringTokenizer stg=new StringTokenizer(in.readLine());
			a=stg.nextToken();
			b=stg.nextToken();
			left=Integer.parseInt(a);
			right=Integer.parseInt(b);
			String[] checked=new String[a.length()];
			
			outer:for(int j=left; j<=right; j++)
			{
				if(a.length()==1)
					break;
				String temp=""+j;
				Arrays.fill(checked,null);
				inner:for(int m=0; m<temp.length()-1; m++)
				{
					temp=temp.charAt(temp.length()-1)+temp.substring(0,temp.length()-1);
					for(int n=0; n<m; n++)
					{
						if(temp.equals(checked[n]))
							continue inner;
					}
					checked[m]=temp;
					int n=Integer.parseInt(temp);
					if(n>j && n>left && n<=right)
					{
						numPairs++;
					}
				}
			}
			out.println("Case #"+(k+1)+": "+numPairs);
		}
		
		out.close();
	}
}
