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.*;

public class C
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());	
		
		String[] line;
		for(int i=1;i<=T;i++)
		{
			line = br.readLine().split("\\W+");
			int a = Integer.parseInt(line[0]);
			int b = Integer.parseInt(line[1]);
			System.out.println("Case #"+i+": "+recycled(a,b));
		}
	}
	
	public static long recycled(int a,int b)
	{
		long ret = 0;
		int[] cache = new int[30];
		for(int i=a;i<b;i++)
		{
			int temp = i;
			int len = 0;
			int p;
			for(p = 1;temp/p!=0;p*=10)len++;
			
			p = p/10;
			int in = 10;
			int count = 0;
//			System.out.println(i+" length "+len);
			for(int j=1;j<len;j++, in *= 10)
			{
				int r  = temp%in;
				int l  = temp/in;
				int n  = (r*10*p)/in;
				n  += l;
				if(n<=i || n<a || n > b) continue;

				boolean found = false;
				for(int k = 0;k<count;k++)
					if(cache[k] == n)
					{
						found = true;
						break;
					}
			        if(found) continue;		
				cache[count++] = n;
				ret++;
			}
		}
		return ret;
	}	
}
