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.util.List;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Set;
import java.util.HashSet;
import java.io.*;

public class Rec {
	public static void main(String args[]) throws IOException {
		//Scanner in = new Scanner(System.in);
		//int n = in.nextInt();
		//in.nextLine();
		
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter("output1.in");
		
		String sss = "";
		sss = br.readLine();
		
		int num = Integer.parseInt(sss);
		
		List<String> l = new ArrayList<String>();
		
		while((sss = br.readLine()) != null)
			l.add(sss);
		
		int count = 0;
		
		for (String s : l) {
			count++;
			
			Set<String> set = new HashSet<String>();
			
			String val[] = s.split(" ");
			int rear = Integer.parseInt(val[0]);
			int max = Integer.parseInt(val[1]);
			
			if (String.valueOf(rear).length() == 1) {
				if (count == 0)
					pw.print("Case #" + count + ": " + 0);
					//System.out.print("Case #" + count + ": " + 0);
				else
					pw.print("\n" + "Case #" + count + ": " + 0);
					//System.out.print("\n" + "Case #" + count + ": " + 0);
			} else {
				int len = String.valueOf(rear).length();
				
				for (int c = rear; c <= max; c++) {
					String ss = String.valueOf(c);
					for (int u = 1; u < len; u++) {
						String sub = ss.substring(u);
						int f_s = Integer.parseInt(String.valueOf(sub.charAt(0)));
						
						if (f_s > Integer.parseInt(String.valueOf(String.valueOf(max).charAt(0))))
							continue;
						if (f_s == 0)
							continue;
							
						sub = sub.concat(ss.substring(0,u));
						
						if ((Integer.parseInt(sub) > c) && (Integer.parseInt(sub) <= max))
							if (c < Integer.parseInt(sub) && c >= rear) {
								set.add(String.format("%s %s", c, sub));
							}
					}
				}
				
				if (count == 0)
					pw.print("Case #" + count + ": " + set.size());
					//System.out.print("Case #" + count + ": " + set.size());
				else
					pw.print("\n" + "Case #" + count + ": " + set.size());
					//System.out.print("\n" + "Case #" + count + ": " + set.size());
				pw.flush();
			}
		}
		
		pw.close();
		
	}
}