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.util.Scanner;
import java.util.LinkedList;
public class ProblemC {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt(); //number of cases
		scan.nextLine();
		
		for (int k = 1; k <= T; k++) {
			int A = scan.nextInt();
			int B = scan.nextInt();

			int count = 0;
			for (int i = A; i <= B; i++) {
				String original = ""+i;
				LinkedList<Integer> recycleList = new LinkedList<Integer>();
				for (int j = 1; j< original.length(); j++) { //where to rotate from
					if (original.charAt(j) < original.charAt(0)) //eliminate some obvious "decreasing" cases
						continue;								 //since they'll be duplicated anyway.
					String newstr = original.substring(j) + original.substring(0,j);
					int newint = Integer.parseInt(newstr);

					if (newint > i && newint <= B) {//don't count duplicates or pairs out of range
						if (!recycleList.contains(newint)) {//no duplicate recycles
							count++;
							recycleList.add(newint);
						}
					}
				}
			}
			//System.err.println("count: " + count);
			int solution = count;

			System.out.println("Case #" + k + ": " + solution);
		}
	}

}
