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.io.*;
import java.util.*;

public class ProblemC {
	public static void main(String[] args) {
		/*
		try {
			System.setIn(new FileInputStream("c-example.in"));
		} catch (Exception e) {}
		*/
		new ProblemC();
	}
	
	public ProblemC() {
		Scanner input = new Scanner(System.in);
		int cases = input.nextInt();
		for (int n = 0; n < cases; n++) {
			int lower = input.nextInt();
			int upper = input.nextInt();
			System.out.println("Case #" + (n+1) + ": " + findPairs(lower, upper));
		}
	}
	
	private int findPairs(int lower, int upper) {
		List<Integer> pairs = new ArrayList<Integer>();
		for (int i = lower; i <= upper; i++) {
			List<Integer> p = recycle(i);
			for (int j : p) {
				if (j >= i && j <= upper) {
					pairs.add(j);
					//System.out.println(i + ", " + j);
				}
			}
		}
		return pairs.size();
	}
	
	private List<Integer> recycle(int n) {
		List<Integer> p = new ArrayList<Integer>();
		int m = n;
		int len = Integer.toString(n).length();
		int mult = (int)Math.pow(10, len - 1);
		for (int i = 0; i < len; i++) {
			int d = m % 10;
			m /= 10;
			m += (d * mult);
			if (m != n && len == Integer.toString(m).length() && !p.contains(m)) {
				p.add(m);
			}
		}
		return p;
	}
}
