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.ArrayList;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		int A, B, result,len,i,j,k;
		String that,original;
		String test="";
		ArrayList<String> poss = new ArrayList<String>();
		for(int zz = 1; zz <= T;zz++){
			result=0;
			A = in.nextInt();
			len = String.valueOf(A).length();
			poss = new ArrayList<String>();
			B = in.nextInt();
			in.nextLine();
			for (i = A; i <= B; i++){
				poss.add(String.valueOf(i));
			}
			for (i = 0; poss.size() > 0; i++){
				that = poss.get(0);
				poss.remove(0);
				original=that;
				for (k=0; k < len; k++){
					test=test+that.charAt(len-1);
					for (j=0; j < (len-1); j++){
						test=test+that.charAt(j);
					}
					if (that.charAt(len-1) != '0' && poss.contains(test)){
						result++;
						//System.out.format("(%s,%s)\n",original,test);
					}
					that=test;
					test="";
				}
			}
			System.out.format("Case #%d: %d\n",zz, result);
		}
	}
}
