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

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		scan.nextLine();
		int c = 1;
		while(scan.hasNextLine()) {
			Scanner ls = new Scanner(scan.nextLine());
			System.out.println("Case #" + c++ + ": " + process(ls.nextInt(), ls.nextInt()));
		}
	
	}
	
	public static int process(int a, int b) {
		int count = 0;
		for(int n = a; n < b; n++) {
			for(int m = n + 1; m <= b; m++) {
				count += isRecyclable(n, m);
			}			
		}
		return count;
	}
	
	public static int isRecyclable(int n, int m) {
		//System.err.println("testing " + n + ", " + m);
		String ns = "" + n;
		String ms = "" + m;
		
		//find start
		int id = 0;
		int c = 0;
		while(id >= 0 && c < ns.length()) {
			id = ns.indexOf(ms.charAt(0), c);
			if(id >= 0) {
				int i = 0;
				boolean worked = true;
				for(int firstPass = id; firstPass < ns.length(); firstPass++) {
					if(ms.charAt(i++) != ns.charAt(firstPass)) {
						worked = false;
						break;
					}
				}
				if(worked) {
					for(int secondPass = 0; secondPass < id; secondPass++) {
						if(ms.charAt(i++) != ns.charAt(secondPass)) {
							worked = false;
							break;
						}
					}
				}
				if(worked) {
					System.err.println("found: " + ns + ", " + ms);
					return 1;					
				}
				c = id + 1;
			}
		}
		return 0;
	}
}
