package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;

public class RecycledNumbers {
	
	private static String shiftLeft(String str) {
		
		char first_char = str.charAt(0);
		
		String new_number_str = str.substring(1);
		
		new_number_str += first_char;
		
		return new_number_str;
	}
	
	private static boolean recycled(int num1, int num2) {
		String num1Str = Integer.toString(num1);
		String num2Str = Integer.toString(num2);
		
				
		for(int i = 0; i < num2Str.length() - 1; i++) {
			String newStr2 = shiftLeft(num2Str);
			if(num1Str.equals(newStr2))
				return true;
			
			num2Str = newStr2;
		}
		return false;
	}
	
	private static int numDigits(int number) {
		if(number == 0)
			return 1;
		
		int numDigits = 0;
		while(number != 0) {
			number /= 10;
			numDigits++;
		}
		
		return numDigits;
	}

	public static void main(String[] args) throws IOException {
		  FileInputStream fstream = new FileInputStream("input.txt");
		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  
		  FileWriter fstreamOut = new FileWriter("output.txt");
		  BufferedWriter out = new BufferedWriter(fstreamOut);
		  
		  String strLine = br.readLine();
		  if(strLine.charAt(strLine.length() - 1) == '\n')
			  strLine = strLine.substring(0, strLine.length() - 1);
		  
		  int numCases = Integer.parseInt(strLine);
		  
		  for(int i = 1; i <= numCases; i++) {
			  strLine = br.readLine();
			  if(strLine.charAt(strLine.length() - 1) == '\n')
				  strLine = strLine.substring(0, strLine.length() - 1);
			  
			  int space = strLine.indexOf(' ');
			  
			  int A = Integer.parseInt(strLine.substring(0, space));
			  int B = Integer.parseInt(strLine.substring(space + 1));
			  
			  //System.out.println(A + " and " + B);
			  
			  int numCase = 0;
			  
			  for(int m = A + 1; m <= B; m++) {
				  for(int n = A; n < m; n++) {
					  if(recycled(n, m)) {
						  //System.out.println("WORKS: " + m + " and " + n);
						  numCase++;
					  }
				  }
			  }
			  
			 out.write("Case #" + i + ": " + numCase);
			 if(i < numCases)
				 out.write("\n");
		  }
		  
		  in.close();
		  br.close();
		  
		  out.close();
	}
}
