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.util.Scanner;

public class C {
	public static void main (String[] args)
	{
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int a, b;
		int[] list;
		for (int i = 1; i <= n; i++)
		{
			a = scan.nextInt();
			if (a < 10)
				a = 10;
			b = scan.nextInt();
			int count = 0;
			for (int j = a; j < b; j++)
			{
				String str = "" + j;
				int len = str.length();
				list = new int[len];
				int lp = 0;
				for (int k = 1; k < len; k++)
				{
					String str2 = str.substring(len-k) + str.substring(0, len-k);
					int res = Integer.valueOf(str2);
					if (str2.charAt(0) != '0' && res > j && res <= b)
					{
						if (!contains(list, lp, res))
						{
							list[lp] = res;
							lp++;
							//System.out.println(j + " " + res);
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
		}
	}
	private static boolean contains(int[] list, int lp, int res)
	{
		for (int i = 0; i < lp; i++)
			if (list[i] == res)
				return true;
		return false;
	}
}
