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

public class C {
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		
		Scanner sc = new Scanner(br.readLine());
		int T = sc.nextInt();
		int caseNumber = 1;
		
		
		for(int i=0; i<T; i++){
			sc = new Scanner(br.readLine());
			int A = sc.nextInt();
			int B = sc.nextInt();
			
			int n = A;
			int m = A;
			int count = 0;
			
			
			for(int j=A; j<B; j++){
				n = j;
				
				for(int k=j; k<B; k++){
					m = k+1;
					
					String sn = ""+n;
					String sm = ""+m;
					if(n<m && !sn.equals(sm)){
						for(int l=1; l<sn.length(); l++){
							String smt = sm.substring(l) + sm.substring(0, l);
							if(Integer.parseInt(smt) == n){
								//System.out.println("sn="+sn + "    sm="+ sm);
								count++;
							}
						}
					}
				}
			}
			
			
			
			System.out.println("Case #"+caseNumber+": "+ count);
			caseNumber++;
		}
		
	}
}