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 google.jam.code;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @author walir
 *
 */
public class RecycledNumbers {

	private BufferedReader bufferedReader;

	public RecycledNumbers() throws FileNotFoundException {
		File file = new File("C:/test");
		InputStreamReader in = new InputStreamReader(new FileInputStream(file));
		bufferedReader = new BufferedReader(in);
	}

	public static void main(String[] args) throws NumberFormatException, IOException{
		RecycledNumbers  recycledNumbers = new RecycledNumbers();
		recycledNumbers.bp();
	}

	private void bp() throws NumberFormatException, IOException {
		int numberOfCases = Integer.valueOf(bufferedReader.readLine());

		for (int i = 1; i <= numberOfCases; i++) {
			String s[] = bufferedReader.readLine().split(" ");
			Integer lLim = Integer.valueOf(s[0]);
			Integer uLim = Integer.valueOf(s[1]);
			int res = calc(lLim, uLim);
			System.out.println("Case #" + i + ": " + res);
		}
		
	}

	private int calc(Integer lLim, Integer uLim) {
		int total = 0;
		for(int l = lLim;l<uLim;l++){
			for(int u = lLim;u<=uLim;u++){
				if(l<u && recycleable(l,u))
					total++;
			}
		}
		return total;
	}

	private boolean recycleable(int l, int u) {
		int temp = l;
		
		int d = 0;
		while(temp>0){
			temp /= 10;
			d++;
		}
		int a[]=new int[d];
		for(int i=0;i<d;i++){
			int t = (int) (u%10);
			u /= 10;
			a[d-1-i] = t;
			
		}
		for(int s = 1; s < d; s++){
			int b  = shift(a, s);
			if((l ^ b) == 0)
				return true;
		}
		return false;
	}

	private int shift(int[] a, int s) {
		int r = 0;
		int l = a.length;
		for(int i=0;i<l;i++){
			r = r*10 + a[(s+i)%l];
		}
		//System.out.println(r);
		return r;
	}

}
