import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

package code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class Main {

	public static void main(String[] args) {
		int T;
		try {
			BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
			PrintWriter out = new PrintWriter(new BufferedWriter(
					new FileWriter("out")));
			String strLine;
			String outLine;
			strLine = in.readLine();
			T = Integer.valueOf(strLine);
			for (int i = 0; i < T; i++) {
				strLine = in.readLine();
				String result = "";
				String[] stringArray = strLine.split(" ");
				// char[] charArray = strLine.toCharArray();
				int A = Integer.valueOf(stringArray[0]);
				int B = Integer.valueOf(stringArray[1]);
				int count = 0;
				for (int j = A; j <= B; j++) {
					for (int k = j+1; k <= B; k++) {
						if(isRecycledNumber(j,k))
							count++;
					}
				}

				outLine = "Case #" + (i + 1) + ": " + count;
				out.println(outLine);
			}
			in.close();
			out.flush();
			out.close();

		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	private static boolean isRecycledNumber(int j, int k) {
		String jStr = String.valueOf(j);
		String newStr;
		for(int i=1;i<jStr.length();i++){
			newStr= jStr.substring(i)+jStr.substring(0,i);
			if(k == Integer.valueOf(newStr))
				return true;
		}

		return false;
	}

}
