import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class C2 {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(); in.nextLine();		
		
		//for each test case
		for (int i = 1; i <= T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			
			int result = 0;
			
			for (int n = A; n <= B - 1; n++)
			{
				String strN = "" + n;
				int length = strN.length();
				List<Integer> foundNewNums = new LinkedList<Integer>();
				
				for (int j = 1; j < length; j++)
				{
					String newNum = "";
							
					for (int k = 0; k < length; k++)
						newNum += strN.charAt((j + k) % length);
					
					int newNumInt = new Integer(newNum);
					
					if (newNumInt > n && newNumInt <= B && !foundNewNums.contains(newNumInt))
					{
						foundNewNums.add(newNumInt);
						result++;
					}
				}
			}
			
			System.out.format("Case #%d: %d\n", i, result);
		}
	}
}