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 gcj2012.qr;

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

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException, IOException{
		String nomeArquivo = "C-small-attempt0";
		
		BufferedReader br = new BufferedReader(new FileReader(nomeArquivo + ".in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(nomeArquivo + ".out"));
		int t = Integer.parseInt(br.readLine());
		for (int i=1; i<=t; i++){
			String campos[] = br.readLine().split(" ");
			int na = Integer.parseInt(campos[0]);
			int nb = Integer.parseInt(campos[1]);
			int total = 0;
			for (int m=na; m<nb; m++){
				for (int n=m+1; n<=nb; n++){
					String a = String.valueOf(m);
					String b = String.valueOf(n);
					int pb = b.indexOf(a.charAt(0));
					boolean achou = false;
					while (pb >= 0){
						int pa = 0;
						int x = pb;
						while (a.charAt(pa++) == b.charAt(pb++)){
							if (pb >= b.length()) pb = 0;
							if (pa >= a.length()){
								achou = true;
								break;
							}
						}
						if (achou){
							total++;
							break;
						}
						pb = b.indexOf(a.charAt(0), x+1);
					}
				}
			}
			bw.write("Case #" + i + ": " + total + "\n");
		}
		br.close();
		bw.close();
	}

}
