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);
	}
}

package com.google.codejam;

public class RecycledNumbers {
	public int solve(int[] n){
		int res = 0;
		int len = getLen(n[0]);
		int[] sh = new int[len-1];
		for (int i = n[0]; i <= n[1]; i++) {
			for (int j = 1; j < len; j++) {
				int ni = shift(i, j, len);
				sh[j-1] = ni; 
				if(ni > i && ni <= n[1]) {
					boolean dup = false;
					for (int k = 0; k < j-1; k++) {
						if(sh[k] == ni) dup = true;
					}
					if(!dup) res++; 
				}
			}
		}
		return res;
	}

	private int shift(int i, int j, int len) {
		int ex = i % ((int)Math.pow(10, j));
		int div = i / (int)Math.pow(10, j);
		return ex * (int)Math.pow(10, len-j) + div;
	}

	private int getLen(int n) {
		int c = 0;
		while(n > 0){
			n /= 10;
			c++;
		}
		return c;
	}
}
