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 numbers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;

public class Solution {

	public static void main(String[] args) throws IOException {
		
		
		BufferedReader br = new BufferedReader(new FileReader("C-small0.in"));
		BufferedWriter wr = new BufferedWriter(new FileWriter("output"));
		
		Integer cases = Integer.valueOf(br.readLine());
		for (int caseNumber = 1; caseNumber<=cases; ++caseNumber){
			String[] line = br.readLine().split(" ");
			Integer A = Integer.valueOf(line[0]);
			Integer B = Integer.valueOf(line[1]);
			StringBuffer bf = new StringBuffer();
			bf.append("Case #");
			bf.append(caseNumber);
			bf.append(": ");
			
			if (A<11)
				A = 11;
			int counter = 0;
			for (int n=A; n<=B;++n){
				counter += findRecycled(n, B);
			}
			bf.append(counter);
			wr.write(bf.toString());
			wr.newLine();
			wr.flush();
		}

	}

	private static int findRecycled(int n, int limit) {
		
		int retVal = 0;
		HashSet<String> possibles = new HashSet<String>();
		String base = String.valueOf(n);
		for (int i=1; i<base.length();++i){
			String possibility = base.substring(i).concat(base.substring(0,i));
			possibles.add(possibility);
		}
		for (String possibility : possibles){
			int check = Integer.valueOf(possibility);
			if (check>n && check<=limit)
				++retVal;
		}
		return retVal;
	}

}
