import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Hashtable;


public class RecycleNumber_1 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		try {
			BufferedReader br = new BufferedReader(new FileReader("/Users/kushal/Downloads/C-large.in"));
			PrintWriter pr = new PrintWriter("/Users/kushal/Desktop/recycle.out");
			String line = "";
			br.readLine();
			int start;
			int end;
			int count;
			int number = -1;
			int temp , p1, p2;
			String str;
			int z = 1;
			HashSet<String> hash = new HashSet<String>();
			ArrayList<Integer> digits;
			while((line = br.readLine()) != null)
			{
				start = Integer.parseInt(line.split(" ")[0]);
				end = Integer.parseInt(line.split(" ")[1]);
				digits = new ArrayList<Integer>();
				count = 0;
				hash.clear();
				for(int i=start; i<=end; i++)
				{
				
					number = i;
					//hash.add(i);
					
					if(i == 121)
					{
						//System.out.println(i+"kk");
					}
					digits = new ArrayList<Integer>();
					while(number > 0)
					{
						digits.add(number%10);
						number /= 10;
					}
					number = digits.get(digits.size() - 1);
					for(int j = digits.size() - 2 ;j >= 0; j--)
					{
						str = "" + digits.get(j);
						if(j == 0 )
						{
							p1 = digits.size() -1;
						}
						else
						{
							p1 = j - 1;
						}
						str += "" + digits.get(p1);
						while(true)
						{							
							if(p1 == 0)
							{
								p1 = digits.size() -1;
							}
							else
							{
								p1 = p1 - 1;
							}
							if(p1 == j)
							{
								break;
							}
							str += "" + digits.get(p1);
						}
						//System.out.print(str + "\t");
						if(!str.startsWith("0"))
						{
							temp = Integer.parseInt(str);
							if((temp < i) && (temp >= start) && (temp <= end))
							{
								if(!hash.contains(i+"_"+temp))
								{
									hash.add(i+"_"+temp);
									//System.out.println(i + " "+ count);
									//continue;
									count++;
								}
							}
						}
					}
					//System.out.println();
				}
				System.out.println("Case #"+z+": "+count);
				z++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}
