import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.ArrayList;
import java.util.Scanner;


public class RecycledNumbers {
	
	static ArrayList<intMapping> included;
	
	public static void main(String[] args) {
//		Scanner sc = new Scanner(System.in);
		Scanner sc;
		try {
			sc = new Scanner(new FileInputStream("C-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			sc = new Scanner(System.in); // file not exist, so get input from console
		}

		Writer out;
		try {
			out = new OutputStreamWriter(new FileOutputStream("C-small.out"));
		} catch (FileNotFoundException e) {
			out = new OutputStreamWriter(System.out); // use console
		}
		
		int T = sc.nextInt();
//		sc.nextLine();
		
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt(), B = sc.nextInt();
			int count = 0;
			included = new ArrayList<intMapping>();
			
			for (int max = B; max > A; max--) {
				count += countShitMatches(max, A);
			}
			
			// output
			System.out.println("Case #" + (t + 1) + ": " + count);
			try {
				out.write("Case #" + (t + 1) + ": " + count + "\n");
			} catch (IOException e) {
				// do nothing
			}
		}

		try {
			out.close();
		} catch (IOException e) {
			// do nothing
		}
	}

	static int countShitMatches(Integer input, int min) {
		int count = 0;
		String number = input.toString();
		for (int i = 1; i < number.length(); i++) {
			number = digitShift(number);
			int result = Integer.parseInt(number);
			if (result >= min && result < input)
				if (!mappingExists(input, result)) {
					included.add(new intMapping(input, result));
					count++;
			}
		}
		
		return count;
	}
	
	static String digitShift(String input) { // moves first digit to end of number represented by a String
		return input.substring(1).concat(input.substring(0, 1));
	}
	
//	static Boolean mappingExists(Integer k, Integer v) {
//		return included.contains(new intMapping(k, v));
//	}

//	static Boolean mappingExists(Integer k, Integer v) {
//		intMapping test = new intMapping(k, v);
//		
//		for (intMapping m : included) {
//			if (m.equals(test))
//				return true;
//		}
//		
//		return false;
//	}
	
	static Boolean mappingExists(Integer k, Integer v) {
		for (intMapping m : included) {
			if (m.key == k && m.value == v)
				return true;
			if (m.key == v && m.value == k)
				return true;
		}
		
		return false;
	}
	
	static class intMapping { //implements Comparable<intMapping> {
		public int key, value;
		
		public intMapping(int k, int v) {
			key = k;
			value = v;
		}

//		@Override
//		public int compareTo(intMapping other) {
//			if ((other.key == this.key && other.value == this.value) || (other.key == this.value && other.value == this.key))
//				return 0;
//			else return 1;
//		}
	}
}
