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

import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
		
	private static int doit(int n, int low) {
		Set<Integer> result = new HashSet<Integer>();
		String val = "" + n;
		int tmpN;
		for (int i = 1; i < val.length(); i++) {
			tmpN = Integer.parseInt(val.substring(i) + val.substring(0, i));
			if (tmpN >= low && tmpN < n && (String.valueOf(tmpN).length() == String.valueOf(n).length())) {
				result.add(tmpN);
			}
		}
		return result.size();
	}
	
	private static int solve(int a, int b) {
		int result = 0;
		for (int i = a; i <= b; i++) {
			result += doit(i, a);
		}
		return result;
	}
	
	public static void main(String[] args) throws Exception {
		String[] in = ProblemUtils.readInput("/home/laf/Downloads/C-small-attempt0.in");
		//String[] in = ProblemUtils.readInput("/home/laf/Desktop/in.txt");
		String[] out = new String[in.length];
		String[] tokens;
		for (int i = 0; i < out.length; i++) {
			tokens = in[i].split(" ");
			out[i] = "" + solve(Integer.parseInt(tokens[0]), Integer.parseInt(tokens[1]));
		}
		ProblemUtils.writeOutput("/home/laf/Desktop/out.txt", out);
	}
	
}
