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.HashSet;
import java.util.Hashtable;
import java.util.Scanner;
import java.util.Set;


public class CodeJamC {
	
	
	public static void main(String args[]){
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		int a;
		int b;
		int m;
		int n;
		String stra;
		String str;
		for(int i = 1; i <= t; i++){
			a = scn.nextInt();
			b = scn.nextInt();
			Set<String> set = new HashSet<String>();
			
			for(int j = a; j <= b; j++){
				
				stra = j+"";
				str = stra;
				for(int k = 1; k < stra.length();k++){
					str = str.charAt(str.length()-1) + str.substring(0,str.length()-1);
					n = Integer.parseInt(str);
					
					if(n <= a)
						continue;
					if(n<=j)
						continue;
					if(n>b)
						continue;
					
					if(j<n){
						set.add(j+""+n+"");
					}else{
						set.add(n+""+j+"");
					}
				}
			}
			
			System.out.println("Case #"+i+": "+set.size());
		}
	}
}
