import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.util.*;
class xyzappp
{
	public static void main(String args[])
	{
	Scanner sc=new Scanner(System.in);
	int p=sc.nextInt();
	int t=1;
		while(p!=0)
		{
			int z=sc.nextInt();
			int b=sc.nextInt();
				int cnt=0;

		for(int i=z;i<=b;i++)
		{
			int a[]=new int[5000];
			String s=""+i;
			int cnt1=0,d=0;
			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>=z)&&(w<=b))
				{
					a[d]=w;
					d++;

					cnt1++;


				}
			}
				int e=0,cnt2=0;
				while(a[e]!=0)
				{
					cnt2++;
					e++;
				}
				int len=cnt2;
				for(int l=0;l<len;l++)
				{
					for(int m=l+1;m<len;m++)
					{
						if(a[l]==a[m])
						{
							for(int o=m;o<len-1;o++)
							{
								a[o]=a[o+1];
							}
							len--;

						}
					}
				}

				if(len!=cnt1)
				{
					cnt1=len;
				}
				cnt+=cnt1;

		}


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


	t++;
p--;		
		}
	
	}
}