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.*;

public class RecycledNumbers {

	public static void main(String[] args) {
		if(args.length < 1) {
			System.out.println("Need a filename.");
		}
		else {
			File file = new File(args[0]);
			try {
				BufferedReader fin = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
				int numCases = Integer.parseInt(fin.readLine());
				for(int i=0; i<numCases; i++) {
					String line = fin.readLine();
					int min = Integer.parseInt(line.substring(0, line.indexOf(" ")).trim());
					int max = Integer.parseInt(line.substring(line.indexOf(" ")).trim());
					int count = 0;
					for(int a=min; a<max; a++) {
						for(int b = a+1; b<=max; b++) {
							if(isRecycled(a, b))
								count++;
						}
					}
					System.out.println("Case #" + (i+1) + ": " + count);
				}
			} catch(FileNotFoundException e) {
				System.err.println("File not found!");
			} catch(IOException e) {
				System.err.println("Could not read file!");
			}
		}
	}
	
	private static boolean isRecycled(int a, int b) {
		String aStr = "" + a;
		String bStr = "" + b;
		for(int i=1; i<aStr.length(); i++) {
			if((aStr.substring(i) + aStr.substring(0, i)).equals(bStr))
				return true;
		}
		return false;
	}
}
