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.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;


public class GCJC {

	static HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();

	public static void main(String[] args) {
		try {
			FileReader in = new FileReader("C-large.in");
			BufferedReader br = new BufferedReader(in);

			File file = new File("./largeC.txt");
			FileWriter fw = new FileWriter(file);

			String line;
			int num = Integer.valueOf(br.readLine());
			int caseNum = 1;

			while ((line = br.readLine()) != null) {

				map = new HashMap<Integer,Integer>();
				StringBuilder sb = new StringBuilder();
				sb.append("Case #" + caseNum + ": ");
				caseNum++;

				int res = 0;
				int a = Integer.valueOf(line.split(" ")[0]);
				int b = Integer.valueOf(line.split(" ")[1]);


				for(int i = a; i <= b ; i++){
					for(int j = 10; j <= i ; j*=10){
						int digit = (int)Math.log10(i) + 1;
						int top = i/j;
						int back = i%j;
						int cycle = (int) (back * Math.pow(10, (digit - (int)Math.log10(j))) + top);
						if(map.get(i) != null && map.get(i) == cycle) continue;
						if(cycle <= b && i < cycle){
							map.put(i, cycle);
							res++;
						}
					}
				}

				sb.append(res);
				fw.write(new String(sb));
				fw.write("\n");
			}

			br.close();
			in.close();
			fw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

}
