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.*;
import java.util.*;

public class Recycle {

	public static void main(String[] args) throws FileNotFoundException, IOException {
		Scanner sc = new Scanner(new File("input.in"));
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);

		int T = sc.nextInt(); // number of cases
		int A;
		int B;
		int counter;
		int m;
		String nStr = "";
		String mStr = "";
		String front = "";
		String back = "";
		
		for(int i = 1; i <= T; i++) { // for each test case
			A = sc.nextInt();
			B = sc.nextInt();
			counter = 0;
			
			for(int n = A; n <= B; n++) { // at most 899 loops
				nStr = Integer.toString(n);
				if(nStr.charAt(0) == '0')
					continue;
				// create m
				for(int j = 1; j < nStr.length(); j++) { // at most 3 loops
					front = nStr.substring(0, j);
					back = nStr.substring(j);
					mStr = back.concat(front);
					if(mStr.charAt(0) == '0')
						continue;
					m = Integer.parseInt(mStr);
					
					if(n >= A && n < m && m <= B)
						counter++;
				}
			}
			out.write("Case #" + i + ": " + counter);
			if(i != T)
				out.newLine();
		}
		out.close();
	}
}
