import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.*;
class recycle
{
	public static void main(String args[])throws Exception
	{
		FileReader R=new FileReader("input.txt");
		PrintWriter W=new PrintWriter(new FileWriter("output.txt"));
		BufferedReader ds=new BufferedReader(R);
		long n=Long.parseLong(ds.readLine());
		for(long j=1;j<=n;j++)
		{
			long i;
			String l=ds.readLine();
			for(i=0;i<l.length();i++)
			{
				if(l.charAt((int)i)==' ')
					break;
			}
			long a=Long.parseLong(l.substring(0,(int)i));
			long b=Long.parseLong(l.substring((int)i+1));
			long p=1,cnt=0;
			String x="",y="";
			for(i=a;i<=b;i++)
			{
				p=1;
				x=Long.toString(i);
				y=x.substring((int)p)+x.substring(0,(int)p);
				while(!(x.equals(y)))
				{
					if(Long.parseLong(y)>Long.parseLong(x) && Long.parseLong(y)<=b)
						cnt++;
					p++;
					y=x.substring((int)p)+x.substring(0,(int)p);
				}
			}
			W.println("Case #"+j+": "+cnt);
		}
		W.close();
	}
}