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.util.*;
class xyz
{
	public static void main(String args[])
	{
		Scanner sc=new Scanner(System.in);
	int p=sc.nextInt();
	int t=1;
	while(p!=0)
	{
		int a= sc.nextInt();
		int b=sc.nextInt();
		int cnt=0;
		for(int i=a;i<=b;i++)
		{
			String s=""+i;

			int n=Integer.parseInt(s);
			char c[]=s.toCharArray();
			for(int j=1;j<(c.length);j++)
			{
				char temp;
				temp=c[0];

				for(int k=0;k<(c.length-1);k++)
				{


					c[k]=c[k+1];



				}
				c[c.length-1]=temp;
				String s1=new String(c);
				int w=Integer.parseInt(s1);
				if((w>n)&&(w>=a)&&(w<=b))
					cnt++;


			}
		}
		System.out.println("Case #"+t+": "+cnt);
		t++;
	p--;
	}
	}
}