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.*;
import java.util.*;
public class CSmall {
	public static Set set = new HashSet();
	public static int counter = 0;
	public static void main(String[] args) throws IOException {
		
		Scanner in = new Scanner(new File("C-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C-small.out")));
		
		int T = Integer.parseInt(in.nextLine());
		for (int i = 0; i < T; i++) {
			String[] lim = in.nextLine().split(" ");
			for (int j = Integer.parseInt(lim[0]); j < Integer.parseInt(lim[1]); j++) {
				if (j >= 10) {
					pair(Integer.toString(j), lim);
				}
			}
			
			out.write("Case #"+ (i+1) +": " + set.size());
			if (i != T-1)
				out.write("\n");
			set.clear();
			
		}	
		//System.out.println("1112".charAt("1112".length()-1) + ("1112".substring(0,"1112".length()-1)));

		out.close();
		System.exit(0);
	}
	
	private static void pair(String num, String[] lim) {
		int len = num.length();
		int upLim = Integer.parseInt(lim[1]), lowLim = Integer.parseInt(lim[0]);
		String k = num;
		for (int i = 0; i < len; i++) {
			num = num.charAt(len-1) + num.substring(0,len-1);
			//System.out.println(num + " " + k);
			//System.out.println(num);
			
			int a = Integer.parseInt(num), b = Integer.parseInt(k);
			
			if (a!=b && a <= upLim && a >= lowLim && b <= upLim && b >= lowLim) {
				if (a<b) {
					set.add(num+" "+k);
				} else {
					set.add(k+" "+num);
				}
			}
		}
		
	}
}