package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;


public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("C-small-attempt2.in"));
		PrintWriter out = new PrintWriter("C:\\Users\\JiaKY\\Desktop\\out.txt");
		//Scanner in = new Scanner(System.in);
		
		int n = Integer.valueOf(in.nextLine());
		for(int i=0;i<n;i++){
			String line = in.nextLine();
			String[] data = line.split(" ");
			int start = Integer.valueOf(data[0]);
			int end = Integer.valueOf(data[1]);
			
			Set<Record> set = new TreeSet<Record>();
			for(int s = start;s <= end;s++){
				String ori = String.valueOf(s);
				for(int j=1;j<ori.length();j++){
					String trans = ori.substring(j).concat(ori.substring(0, j));
					int tmp = Integer.valueOf(trans);
					if(tmp <= end && tmp >= start && tmp != s){
						if(tmp > s)
							set.add(new Record(s, tmp));
						else
							set.add(new Record(tmp, s));
					}
				}
			}
			//System.out.println(set);
			out.printf("Case #%d: %d",i+1,set.size());
			out.println();
			out.flush();
		}
		
	}

}
class Record implements Comparable<Record>{
	int a;
	int b;
	public Record(int i,int j) {
		// TODO Auto-generated constructor stub
		a = i;
		b = j;
	}
	@Override
	public int compareTo(Record o) {
		// TODO Auto-generated method stub
		if(o.a != a)
			return a - o.a;
		else
			return b-o.b;
	}
	@Override
	public String toString() {
		// TODO Auto-generated method stub
		return a+" "+b;
	}
	
}
