package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.File;
 import java.io.FileWriter;
import java.io.IOException;
import java.math.BigInteger;
import java.util.Scanner;
 public class C { 

	static String inner = "input.in";
	static Scanner scan;
	public static void main (String[]args) throws IOException
	{ 
		File f = new File (inner);
		File out = new File("output.out");
		FileWriter wr; 
		wr = new FileWriter(out); 
		scan = new Scanner(f); 
		int test = scan.nextInt();
		scan.nextLine();
		for(int i = 0 ;i < test ; i++)
			wr.write( "Case #"+ (i+1)+": "+testcase(  new BigInteger(""+scan.nextInt()) , new BigInteger(""+scan.nextInt()) )   + "\n");
	 	 wr.flush();
	}
	
	public static int testcase (BigInteger A , BigInteger B)
	{ 
		int ret = 0;
		int len = A.toString().length(); 
		for(BigInteger b = A ; b.compareTo(B) < 1 ;b= b.add(BigInteger.ONE) )
		{
			String []ff = new String [len-1];  
			String s =b.toString(); 
			for(int i = 1 ;i <len ; i++)
			{
				BigInteger dum = new BigInteger(s.substring (i) + s.substring(0,i));
				ff[i-1] = dum.toString();	
				if(dum.compareTo(B)!=1 && dum.compareTo(b)==1)
				{
					boolean skip=false;  
					for(int j =0 ; j < i-1 ; j++)
						if(ff[j].equals(ff[i-1])) 
							skip = true;  
					if(skip) continue;
					ret++;
				 
				} 
			}
		}
		return ret;
	}
}
