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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;


public class Recycled {
	private static int NN = 2000010; 
	private static BufferedReader bf;
	private static File f;
	
	public static void main(String[] args) throws Exception {
		f = new File("rasdjfh.in");
		FileWriter out = new FileWriter(new File("recycled.txt"));
		if(f.exists())
			bf = new BufferedReader(new FileReader(f));
		else 
			bf = new BufferedReader(new InputStreamReader(System.in));
		String line = "", pars[],s ,x;
		ArrayList<HashSet<Integer>> recycled = new ArrayList<HashSet<Integer>>(NN);
		for(int i=0;i<NN;i++)
		{
			s = ""+i;
			recycled.add(new HashSet<Integer>());
			for(int j=1;j<s.length();j++)
			{
				x = s.substring(0, j);
				x = s.substring(j)+x;
				Integer I;
				if((I = Integer.parseInt(x)) > i)
					recycled.get(i).add(I);
			}
		}
		System.out.println("Ok, I'm readyÉ");
		int T = Integer.parseInt(bf.readLine()),  A , B;
		for(int t=1;t<=T;t++)
		{
			pars = bf.readLine().split("[ ]+");
			A = Integer.parseInt(pars[0]);
			B = Integer.parseInt(pars[1]);
			int ans = 0;
			for(int i=A;i<=B;i++)
			{
				for(Integer j : recycled.get(i))
					if(j >= A && j <=B)
						ans++;
			}
			out.write(String.format("Case #%d: %d\n",t,ans));
		}
		out.close();
	}
}
