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.*;
public class c{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		long[] powers = new long[10];
		for(int j = 0; j<10; j++){
			powers[j]=(long)Math.pow(10,j);
		}
		for(int tt = 1; tt<=T; tt++){
			int a =sc.nextInt();
			int b =sc.nextInt();
			int val=0;
			for(int i = a; i<b; i++){
				String s=""+i;
				Set<Long> set = new HashSet<Long>();
				for(int j = 1; j<s.length(); j++){
					long s1 = i/powers[j];
					long s2= i-s1*powers[j];
					long s3=s2*powers[s.length()-j]+s1;
					if(s3>i && s3<=b&& !set.contains(s3)){
						val+=1;
					}
					set.add(s3);
				}
			}
			System.out.println("Case #"+tt+": "+val);
		}
	}
}


