import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Recycled {
	private int A;
	private int B;
	private int pairs;

	/**
	 * Constructor
	 * 
	 * @param a
	 * @param b
	 */
	public Recycled(int a, int b) {
		A = a;
		B = b;
		pairs = 0;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			// Input I/O handler
			File input = new File(args[0]);
			Scanner sc = new Scanner(input);
			int cases = Integer.parseInt(sc.nextLine());

			// Output I/O handler
			FileWriter output = new FileWriter(args[1], true);
			PrintWriter pw = new PrintWriter(output);

			// Process all the cases
			for (int i = 1; i <= cases; i++) {
				String[] data = sc.nextLine().split(" ");
				Recycled solver = new Recycled(Integer.parseInt(data[0]),
						Integer.parseInt(data[1]));
				solver.solve();
				pw.println("Case #" + i + ": " + solver.getPairs());
				pw.flush();

			}
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	/**
	 * Returns the number of recycled number pairs.
	 * @return
	 */
	private int getPairs() {
		return pairs;
	}

	/**
	 * Solves the given test case.
	 */
	private void solve() {
		for (int n = A; n <= B; n++) {
			String written = "" + n;
			for (int k = 1; k < written.length(); k++) {
				String swap= written.substring(k) + written.substring(0,k);
				if (written.charAt(0)=='0'){
					continue;
				}
				Integer m= Integer.parseInt(swap);
				if (A <= n && n < m && m <= B) {
					pairs++;
				}
			}
		}
	}
}
