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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;

public class Recycle {

	static PrintStream O = System.out;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			long initTime = System.currentTimeMillis();
			PrintWriter out = new PrintWriter(new FileWriter("C.out"));
			BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
			int cases = Integer.parseInt(in.readLine());
			for (int kase = 0; kase < cases; kase++){
				String input = in.readLine();
				int A = Integer.parseInt(input.split(" ")[0]);
				int B = Integer.parseInt(input.split(" ")[1]);
				out.println("Case #" + (kase + 1) + ": " + count(A, B));
			}
			//O.println(System.currentTimeMillis() - initTime);
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	static int count (int A, int B){
		Set<Long> set = new TreeSet<Long>();
		int count = 0;
		char cA = Integer.toString(A).charAt(0);
		char cB = Integer.toString(B).charAt(0);
		for (long i = A; i < B; i++){
			String s = Integer.toString((int)i);
			long newN;
			for (int j = 1; j < s.length(); j++){
				if (s.charAt(j) >= cA && s.charAt(j) <= cB){
					String tmp = s.substring(j) + s.substring(0,j);
					newN = Integer.parseInt(tmp);
					if (newN != i && newN >= A && newN <= B){
						set.add(i << 21 | newN);
						set.add(newN << 21 | i);
					}
				}
			}
		}
		return set.size() / 2;
	}
}
