package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.Scanner;

public class test {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int T = sc.nextInt();
		int casenum = 1;
		
		while (T-- > 0) {
			 int num = solve(sc);
			 System.out.println("Case #" + casenum++ + ": " + num);
		}

	}

	private static int solve(Scanner sc) {
		int A = Integer.parseInt(sc.next());
		int B = Integer.parseInt(sc.next());
		long ts = System.currentTimeMillis();
		int num = 0;
		for (int a = A; a < B; a++) {
			for (int b = a+1; b <= B; b++) {
				
					if(isrec(a,b)) {
						//if(num < 10)
						//System.out.println("rec: " + a + " and " + b);
						num++;
					}
			}
		}
		ts = System.currentTimeMillis() - ts;
		//System.out.println("time: " + ts);
		return num;
	}

	private static boolean isrec(int a, int b) {
		int hi = a;
		int lo = 0;
		int[] base = {
				1,
				10,
				100,
				1000,
				10000,
				100000,
				1000000,
				10000000,
				100000000,
				1000000000};
		int i = 0;
		int len = 0;
		while(base[len] < a) len++;
		if(b >= base[len] || b <= base[len]/10) return false;
		while (hi > 0){
			int num = lo*base[len-i]+hi;
			
			if(num == b) {
				//System.out.println(a + " " + b + ": " + hi + "|" + lo);
				return true;
			}
			hi /=  10;
			lo = a - hi*base[i+1];
			i++;
		}
		return false;
	}
}
