import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.util.*;
import java.io.*;
import java.text.*;

public class Q {
	private static long solve(int from, int to) {
		int[] flag = new int[2000001];
		long res = 0;
		int t=from/10, b = 1; 
		while (t>0) {
			b*=10;t/=10;
		}
		for (int i = from; i < to; ++i) {
			t = i;			
			do {
				t = (t /10) + (t%10 * b);
				if (t > i && t<= to && flag[t] != i + 1) {
					flag[t] = i + 1;
					++res;
				}				
			} while (t != i);			
		}
		return res;
	}
	
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.txt"));
		PrintStream out = new PrintStream("output.txt");
		
		int num = in.nextInt();
		in.nextLine();
		for (int i=0;i<num;++i) {
			int from = in.nextInt();
			int to = in.nextInt();			
			StringBuilder builder = new StringBuilder("Case #" +(i+1)+": ");
			builder.append(solve(from, to));
			System.out.println(builder.toString());
			out.println(builder.toString());
		}
		
		in.close();
		out.close();
	}	
}
