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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;


public class RecycledNumbers
{
	static BufferedReader br;
	static PrintWriter pw;
	
	static HashMap<String, Boolean> map;
	
	public static void main(String args[])throws IOException
	{
		initFiles();
		
		readFiles();
		
		System.out.println("Done");
	}
	
	private static void readFiles()throws IOException
	{
		int n = Integer.parseInt(br.readLine());
		
		for(int i=1; i<=n; i++)
		{
			System.out.println("Case: " + i);
			StringTokenizer tokens = new StringTokenizer(br.readLine());
			
			int A = Integer.parseInt(tokens.nextToken());
			int B = Integer.parseInt(tokens.nextToken());
			
			int count = findPairs(A, B);
			
			pw.println("Case #" + i + ": " + count);
		}
		
		pw.close();
		br.close();
	}
	
	private static int findPairs(int A, int B)
	{
		map = new HashMap<String, Boolean>();
		
		int numRecycleables = 0;
		for(int i = A; i <= B; i++)
		{
			numRecycleables += getNumRecycled(i, B);
		}
		
		return map.size();
	}
	
	private static int getNumRecycled(int n, int B)
	{
		String nStr = "" + n;
		
		int count = 0;
		for(int i = 1; i < nStr.length(); i++)
		{
			String mStr = nStr.substring(i) + nStr.substring(0, i);
			
			int m = Integer.parseInt(mStr);
			
			if(m > n && m <= B)
			{
				//System.out.println(n + "--> " + m);
				
				map.put(nStr + mStr, true);
				count++;
			}
		}
		
		return count;
	}
	
	private static void initFiles()throws IOException
	{
		br = new BufferedReader(new FileReader("C-large.in"));
		pw = new PrintWriter(new FileWriter("Recycle.out"));
	}
}
