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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		FileReader fReader = new FileReader("input/C-small-attempt0.in");
		BufferedReader br = new BufferedReader(fReader);
		int T = Integer.valueOf(br.readLine());
		int c = 1;
		while (T-- > 0) {
			String[] line = br.readLine().split("\\s");
			Integer first = Integer.valueOf(line[0]);
			Integer second = Integer.valueOf(line[1]);
			Set<String> set = new HashSet<String>();
			int totalCount = 0;
			for (int i = first; i <= second; ++i) {
				String ll = String.valueOf(i);
				for (int j = 1; j < ll.length(); ++j) {
					String tempLine = ll.substring(ll.length() - j);
					tempLine += ll.substring(0, ll.length() - j);
					if (tempLine.startsWith("0")) {
						continue;
					}
					int secondNum = Integer.valueOf(tempLine);
					if (i >= secondNum || secondNum > second) {
						continue;
					}
					String ss = i + "|" + secondNum;
					if (set.contains(ss)) {
						continue;
					}
					set.add(ss);
					totalCount++;
//					System.out.println(ss);
				}
			}
			System.out.println("Case #" + c + ": " + totalCount);
			c++;
			
		}
		fReader.close();
	}
}
