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

public class C2 {
	public static String convert(int num) {
		char[] arr = Integer.toString(num).toCharArray();
		Arrays.sort(arr);
		return new String(arr);
	}
	
	// count lower than A
	public static long countRecycle(int A, int num) {
		//long ans = 0;
		
		StringBuffer s = new StringBuffer(Integer.toString(num));
		HashSet<Integer> set = new HashSet<Integer>();
		for(int i=0;i<s.length(); i++) {
			char c = s.charAt(0);
			s = s.deleteCharAt(0);
			s = s.append(c);
			
			int anotherNum = Integer.parseInt(s.toString());
			if (anotherNum >= A && anotherNum < num){ 
				//System.out.println("RECYCLED: "+num+" "+anotherNum);
				//++ans;
				set.add(anotherNum);
			}
		}
		
		return set.size();
	}
	
	public static void main(String[] args) throws Exception{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		
		int A, B;
		long ans;
		
		for(int caseNo = 1;caseNo <= T; caseNo++) {
			A = in.nextInt();
			B = in.nextInt();
			ans = 0;
			
			for(int num = A; num <= B; num++) {
				ans += countRecycle(A, num);
			}
				
			System.out.println("Case #"+caseNo+": "+ans);
		}
	}
}