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.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		System.out.println("Problem A enter input file:");
		Scanner scan = new Scanner(System.in);
		String sFile = scan.nextLine();
		File f = new File(sFile);
		try {
			BufferedReader r  = new BufferedReader(new FileReader(sFile));
			String current;
			int cnum = 0;
			while((current = r.readLine())!=null) {
				if(cnum>0) {
					System.out.println("Case #"+cnum+": "+solve(current));
				}
				cnum ++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static int solve(String current) {
		StringTokenizer tok = new StringTokenizer(current);
		int a = 0, b = 0, i = 0, s=0;
		while(tok.hasMoreElements()){
			switch(i) {
			case 0: a = Integer.parseInt((String) tok.nextElement());
			break;
			case 1: b = Integer.parseInt((String) tok.nextElement());
			}
			i++;
		}
		for(int n = a; n<b; n++) {
			for(int m = b; m > n; m--) {
				int t = m;
				int digits = String.valueOf(t).length();
				for(i = 1; i<digits; i++) {
					t = (int) ((t % 10)*Math.pow(10, digits-1) + t/10);
					if(t == n)
						s++;
				}
			}
		}
		return s;
	}

}
