package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class Principal 
{
	public static void main(String [] args) throws IOException
	{
		Secundaria sec = new Secundaria();
		
		FileReader fr = new FileReader("C-small-attempt1.in");
		BufferedReader bf = new BufferedReader(fr);
		
		FileWriter bw = new FileWriter("C-small-attempt1.out");
		
		int res;
		int times = Integer.parseInt(bf.readLine());
		
		String str = bf.readLine();
		int i = 1;
		while(i <= times)
		{
			StringTokenizer st = new StringTokenizer(str);	
			int primero = Integer.parseInt(st.nextToken());
			int segundo = Integer.parseInt(st.nextToken());
			bw.write("Case #");
			bw.write(String.valueOf(i));
			bw.write(": ");
			res = sec.nVeces(primero, segundo);
			bw.write(Integer.toString(res));
			bw.write("\n");
			str = bf.readLine();
			i++;
		}
		bw.close();
	}
}
