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.*;

public class RecycledNumber {
	int digits;
	Collection<String> set = new HashSet<String>(); 
	public int countInInterval(int a, int b)
	{
		int count = 0, rotation;
		String temp = ""+ a;
		this.digits = temp.length();
		
		
		for(int i = a; i<b; i++)
		{
			for(int j = 1; j<digits;j++)
			{
				rotation = rotate(i, j);
				if(rotation<=b&&rotation>i&&!set.contains(i+" "+rotation)){ 
					count++;
					set.add(i + " " + rotation);
				}
			}
		}
		return count;

	}
	
	private int rotate(int num, int distance)
	{
		String temp = ""+num;
		temp = temp.substring(distance)+temp.substring(0,distance);
		num = Integer.parseInt(temp);
		return num;
	}
}
