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

public class Pair implements Comparable{
	int n;

	int m;

	public Pair(int n, int m){
		this.n = n;
		this.m = m;
	}

	@Override
	public boolean equals(Object obj){
		if(n == 1212)
			System.out.println("1");

		if(obj == null)return false;

		Pair other = (Pair)obj;
		if(n == other.n && m == other.m){
			return true;
		}
		return false;
	}

	public int hashCode() {
		int hash = 1;
	    hash = hash * 31 + new Integer(n).hashCode();
	    hash = hash * 31 + new Integer(m).hashCode();
		return  hash;
	}

	@Override
	public String toString(){
		return "(" + n + ", " + m + ")";
	}

	@Override
	public int compareTo(Object other){
		Pair p = (Pair)other;
		if(this.n == p.n)
			return new Integer(m).compareTo(new Integer(p.m));
		else
			return new Integer(n).compareTo(new Integer(p.m));
	}
}
