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;


public class Recycled {

	public static void main(String[] args) {
		
		Scanner input = new Scanner(System.in);
		int cases = input.nextInt();
		for (int c = 1; c <= cases; c++)
		{
			int a = input.nextInt();
			int b = input.nextInt();
			int matches = 0;
			for (int n = a; n <= b; n++)
			{
				String strN = String.valueOf(n);
				for (int m = n + 1; m <= b; m++)
				{
					String strM = String.valueOf(m);
					if (check(strN, strM))
						matches++;
				}
			}
			System.out.println("Case #" + c + ": " + matches);
		}
	}

	private static boolean check(String a, String b) {
		for (int k = 1; k < a.length(); k++)
		{
			if ((a.substring(k, a.length()) + a.substring(0, k)).equals(b))
				return true;
		}
		return false;
	}
}
