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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class recycled {


	public static void main(String[] args) throws IOException	
	{
		
		BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
		int nc = Integer.parseInt(in.readLine().trim());



		for (int z=1; z<=nc; z++){
			String[] line = in.readLine().trim().split("\\s+");
			int a = Integer.parseInt(line[0]);
			int b = Integer.parseInt(line[1]);
			boolean[] flgs = new boolean[2000000+1];
			int count = 0;
			for (int i = a; i <=b; i++)
			{
				
				List<Integer> list = new ArrayList<Integer>();
				list.add(i);
				if (flgs[i]) continue;
				
				int val = 1;
				String num1 = i+"";
				for (int j = 1; j <=num1.length(); j++)
				{

					String num2 = num1.substring(j) + num1.substring(0, j);
					int num = Integer.parseInt(num2);
					if (num2.charAt(0)!='0') if (num<=b&&num!=i&&num>a)  if (!flgs[num])
					{		
						list.add(num);
						val++;
						flgs[num] = true;
					}



				}
				val = val*(val-1);
				val>>=1;
				//if (val>0)tr(list);
				
				count+=val;	
				//if (val>0) System.out.println(count);

			}





			//MODIFY
			out.println(String.format("Case #%d: %d", z,count));
		}
		out.close();
	}
	public static void tr(Object...objects)
	{
		System.out.println(Arrays.deepToString(objects));
	}
}
