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 static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.math.*;
import java.util.*;

@SuppressWarnings("unused")
public class C_RecycledNumbers {
	public static void main(String[] args) throws Exception {
		// Scanner in = new Scanner(System.in);
		// PrintStream out = System.out;
		// Scanner in = new Scanner(new File("C-small.in"));
		// PrintStream out = new PrintStream("C-small.out");
		Scanner in = new Scanner(new File("C-large.in"));
		PrintStream out = new PrintStream("C-large.out");
		int T = in.nextInt();
		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			TreeSet<pair> set = new TreeSet<pair>();
			for (int n = A; n <= B; n++) {
				String s = Integer.toString(n);
				for (int j = 0; j <= s.length(); j++) {
					int m = Integer.parseInt(s.substring(j) + s.substring(0, j));
					if (A <= n && n < m && m <= B) {
						set.add(new pair(n, m));
					}
				}
			}
			out.println("Case #" + i + ": " + set.size());
		}
	}

	static class pair implements Comparable<pair> {
		int a, b;

		public pair(int a, int b) {
			this.a = a;
			this.b = b;
		}

		public int compareTo(pair p) {
			if (a == p.a)
				return b - p.b;
			return a - p.a;
		}
	}
}
