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 TaskC {
	public static void main(String[] args) {
		try {
			BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
			int t = Integer.valueOf(input.readLine());
			for(int z=1; z<=t; z++) {
				int out = 0;
				String[] line = input.readLine().split(" ");
				int A = Integer.valueOf(line[0]),
				    B = Integer.valueOf(line[1]);
				    
				for(int i=A; i<=B; i++)
					bylo[i] = false;
				    
				// czas na rotacje    
				ileRot = line[0].length() - 1;
				for(int i=A; i<=B; i++)
					if(bylo[i] == false) {
						bylo[i] = true;
						int dodajnik = 1;
						int liczba = i;
						String ls = Integer.toString(liczba);
						// System.out.println("Rotuje " + ls);
						// rotuje ile sie da
						for(int rot=0; rot<ileRot; rot++) {
							// wykonuje rotacje
							String tmp = ls.substring(1);
							tmp = tmp.concat(Character.toString(ls.charAt(0)));
							ls = tmp;
							liczba = Integer.valueOf(ls);
							// sprawdzam czy mam cos nowego
							if(bylo[liczba]==false && liczba>=A && liczba <= B) {
								// System.out.println("Zgadza sie z " + ls);
								bylo[liczba] = true;
								out += dodajnik;
								dodajnik += 1;
							}
						}
					}
				    
				System.out.println("Case #" + z + ": " + out);
			}
		} catch (Exception e) {
			System.err.println(e);
		}
	}
	
	
	static int ileRot;
	static boolean[] bylo = new boolean[2000001];
}
