import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		
		Scanner in;
		in = new Scanner(new FileReader("C-small.in"));
		FileWriter output = new FileWriter("C-small.out");
		/*in = new Scanner(new FileReader("C-large.in"));
		FileWriter output = new FileWriter("C-large.out");*/
		
		int T = in.nextInt();

		for(int i = 1; i <= T; i++) {
			int a = in.nextInt();
			int b = in.nextInt();

			int recycle = 0;
			for(int n = a; n < b; n++) {
				StringBuffer sb = new StringBuffer(Integer.toString(n));
				sb.trimToSize();
				int m = -1;
				
				for(int j = 1; j < sb.length(); j++) {
					sb.append(sb.charAt(0));
					sb.deleteCharAt(0);
					sb.trimToSize();

					if ( m != Integer.parseInt(sb.toString()) ) {
						int check = m;
						m = Integer.parseInt(sb.toString());

						if(m <= b && m>n) {
							//System.out.println(a + " " + n + " " + m + " " + b);
							recycle++;
						} else m = check;
					}
					
				}
			}
			
			output.write("Case #" + i + ": " + recycle + "\n");
			
		}
		
		in.close();
		output.flush();
		output.close();

	}

}
