import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;

class RecycledNumbers
{
	static int A,B,result;
	public static void main(String args[]) throws IOException
	{
		FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
		DataInputStream dstream = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(dstream));
		FileWriter fw = new FileWriter("output.txt");
		BufferedWriter out = new BufferedWriter(fw);
		
		int lines = Integer.parseInt(br.readLine());		//lines LINES OF INPUT TO FOLLOW
		
		for(int j=0;j<lines;j++)                        //EACH LINE FROM SECOND LINE
		{
			result=0;
		
			out.write("Case #"+(j+1)+": ");
		
			
			
			String str = br.readLine();
			String strAray[] = str.split(" ");
			A = Integer.parseInt(strAray[0]);
			B = Integer.parseInt(strAray[1]);
			
			for(int i=B;i>A;i--)
			{
				result = result+howMany(i);
				
				
			}
			
			out.write(Integer.toString(result));// write result
			out.newLine();
		}		
		fstream.close();
		out.close();
		//log.close();
	}
	static int howMany(int m) throws IOException
	{	
		int n,no=0;
		
		int length = (Integer.toString(m)).length();
		if(length==1)
		{
		
			return 0;
		}
		
		for(int i=1;i<length;i++)
		{
			n=rotate(i,m,length);
					
			if(A<=n && n<m && m<=B)
				no++;
		}
		
		return no;
	}
	static int rotate(int j, int m, int length) throws IOException
	{
		
		
	
		
		
		String s = Integer.toString(m);
		int[] intArray = new int[length];
		int number = 0;
	
 
		for (int i = 0; i < length; i++)
		{
			intArray[i] = Character.digit(s.charAt(i), 10);
		}
		for(int i=0;i<j;i++)					//rotate m , i times
		{
			int temp = intArray[0];
			for(int k=0;k<(length-1);k++)
			{
				intArray[k] = intArray[k+1];
			}
			intArray[length-1] = temp;
		}
		for(int i=0;i<length;i++)
		{
			number = number*10 + intArray[i];
		}
		
		return number;
	}
	
	
}