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.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;

public class C {
	private static Map<Long, Long> map = new HashMap<Long, Long>();

	public static void main(String args[]) {
		try {
			String fileName = "C:\\Users\\Lenovo Z370\\Desktop\\gcj\\comp-2012\\C-large.in";
			BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
			int t = Integer.parseInt(br.readLine());
			for(int i=0; i<t; i++) {
				map.clear();
				String[] abs = br.readLine().split("\\s+");
				long a = Long.parseLong(abs[0]);
				long b = Long.parseLong(abs[1]);
				
				long count = 0;
				
				for(long j=a; j<=b; j++) {
					long n=j;
					String s = String.valueOf(n);
					int l = s.length()-1;
					for(int k=0; k<l; k++) {
						int r = (int)(n%10);
						long m = (long)(r*Math.pow(10, l)) + n/10;

						if(m > j && m >= a && m <= b) {
							Long val = map.get(j);
							if(val == null || val != m) {
								map.put(j, m);
								count++;
							}
						}
						n=m;
					}
				}
				
				System.out.println("Case #" + (i+1) + ": " + count);
			}
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
}
