package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.*;
public class RecycledNo
{
public static void main (String arg[]) throws Exception
{
BufferedReader ob=new BufferedReader (new FileReader("C-small-attempt2.in"));

PrintWriter pw=new PrintWriter ("output.txt");

String temp="";
temp=ob.readLine();
int t=Integer.parseInt(temp);
int a=0,b=0;

for(int l=1;l<=t;l++)
{
 temp=ob.readLine();
 String str="";

 for(int i=0;i<temp.length();i++)
 {
  char ch=temp.charAt(i);
  if(ch==' ')
  {
  a=Integer.parseInt(str);
  str="";
  continue;
  }
  str=str+ch;
 } 
 b=Integer.parseInt(str); 
 int count=0;
 str="";
 for(int k=a;k<=b;k++) 
 {
  str=""+k;
  String s[]=new String[str.length()];
  for(int i=0;i<str.length();i++)
  {
  char ch=str.charAt(i);
  s[i]=""+ch;
  }
  for(int i=1;i<str.length();i++)
  {
  temp=s[0];
  for(int j=0;j<str.length()-1;j++)
  {
  s[j]=s[j+1];
  }
  s[str.length()-1]=temp;
  String R="";
  for(int j=0;j<str.length();j++)
  {
  R=R+s[j];
  }
  int tmp=Integer.parseInt(R);
  if(tmp<=b && tmp>k)
  count++;
  }
 }
 temp="Case #"+l+": "+count;
 pw.println(temp);
}
pw.close();
}
}
