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 codejam.qualification;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("input.txt"));
		FileWriter out = new FileWriter("output.txt");
		
		// ignore test cases
		in.nextLine();
		
		int count = 1;
		while (in.hasNext()) {
			out.write("Case #" + count++ + ": " + calc(in.nextLong(), in.nextLong()) + "\n");
		}
		
		out.flush();
		out.close();
		in.close();
	}
	
	public static long calc(long A, long B) {
		long count = 0;
		
		for (long n=A; n<B; n++) {
			String sNum = Long.toString(n);
			
			for (int x=1; x<sNum.length(); x++) {
				String sCan = sNum.substring(sNum.length() - x) + sNum.substring(0, sNum.length() - x);
				long m = Long.parseLong(sCan);
				
				if (A <= n && n < m && m <= B) {
					System.out.println(n + " " + sCan + " " + sNum.substring(sNum.length() - x));
					count++;
				}
			}
		}
		
		return count;
	}
}
