import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {
	public static void main(String[] args){
		Scanner in;
		try {
			in = new Scanner(new File("C-large.in"));
			solve(in);
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}
	public static void solve(Scanner in){
		int cases =in.nextInt();
		for(int i = 1; i<=cases; i++){
			int min = in.nextInt();
			int max = in.nextInt();
			int ans = 0;
			for(int j =min; j<=max; j++){
				ans+=combos(j, min, max);
			}
			System.out.println("Case #" +i+": "+(ans/2));
			
		}
		
	}
	public static int combos(int num, int min, int max){
		if(num<10){
			return 0;
		}
		HashSet<Integer> diffNums = new HashSet<Integer>();
		diffNums.add(num);
		int ans = 0;
		String numString = num+"";
		for(int i =0; i< numString.length(); i++){
			numString = numString.substring(1)+numString.charAt(0);
			int numTest = Integer.parseInt(numString);
			if(numTest<=max&&numTest>=min&&diffNums.add(numTest)){
				ans++;
			}
		}
		return ans;
		
		
	}
	
}
