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;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Recycled Numbers
 * Date: 2012-04-13
 * Time: 02:08 AM
 */


public class recycle {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int A, B, n, m, y = 0;
			A = in.nextInt();
			B = in.nextInt();
			
			for (int j = 0; j < (B-A); j++) {
				m = B - j;
				String strM = String.valueOf(m);
				
				for (int k = 0; k < (B-A); k++) {
					n = A + k;
					//n must be less than m
					if (n >= m)
						break;
					
					String strN = String.valueOf(n);
					
					for (int l = 1; l < strN.length(); l++) {
						String sub = strN.substring(l);
						String new_strN = sub + strN.substring(0, l);
						
						if (new_strN.equalsIgnoreCase(strM)) {
							y++;
							break;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}

}
