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.IOException;
import java.io.InputStreamReader;
import java.sql.Types;


public class Recycled {

	/**
	 * @param args
	 * @throws IOException 
	 */
	
	public static  int calc(int a,int b) {
		int result = 0;
		int[] numbers = new int[b-a+1];
		int ncircle = 0;
		int type=1;
		for (int i = a; i <= b; i++) {
			ncircle = 0;
			
			if(numbers[i-a]==0)
			{
				numbers[i-a]=type;
				ncircle = 1;
				int tmp=1;
				int n=0;
				while (i/tmp!=0) {
					tmp*=10;
					++n;
				}
				--n;
				tmp /= 10;
				int cur =i;
				for (int j = n; j >0; --j) {
					int up = cur/10;
					int down = cur%10;
					cur = down * tmp + up;
					if(down!=0)
					{
						int shifted = cur;
						if((shifted>=a) && (shifted <=b))
						{
							if(numbers[shifted-a]==0)
							{
								
								numbers[shifted-a]=type;
								++ncircle;
							}
							
						}
					}
				}
				
				result += (ncircle)*(ncircle-1)/2;
				++type;
			}
		}
		return result;
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader bReader  = new BufferedReader(new InputStreamReader(System.in));
		String number = bReader.readLine();
		int num = Integer.parseInt(number);
		for (int i = 0; i < num; i++) {			
			String s = bReader.readLine();
			String[] strs = s.split(" ");
			int A = Integer.parseInt(strs[0]);
			int B = Integer.parseInt(strs[1]);
			System.out.println("Case #"+(i+1)+": "+calc(A, B));
		}

	}

}
