import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class C {

	public static void main(String[] args) {
		try {
			// so eclipse can read file from system in
			System.setIn(new FileInputStream(new File("large.in")));
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(1);
		}
		Scanner scanner = new Scanner(System.in);
		long T = scanner.nextLong();
		scanner.nextLine();
		for (int i = 0; i < T; i++) {
			long A = scanner.nextLong();
			long B = scanner.nextLong();
			long count = 0;
			for (long number = A; number <= B; number++) {
				String numberS = String.valueOf(number);
				Set<String> newNumbers = new HashSet<String>();
				for (int k = 1; k < numberS.length(); k++) {
					String newNumberS = numberS.substring(numberS.length() - k) + numberS.substring(0, numberS.length() - k);
					if (newNumbers.contains(newNumberS)) {
						continue;
					}
					newNumbers.add(newNumberS);
					long newNumber = Long.parseLong(newNumberS);
					if (newNumber != number && newNumber > number && newNumber >= A && newNumber <= B) {
						count++;
					}
				}
			}
			System.out.printf("Case #%d: %d%n", i + 1, count);
		}
	}
}
