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

import java.util.ArrayList;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		
		for(int i = 0; i < n; i++) {
			int a = in.nextInt();
			int b = in.nextInt();
			ArrayList<Integer> al = new ArrayList<Integer>();
			
			for(int j = 1; j < a; j++) {
				for(int k = j+1; k <= b; k++) {
					int la, lb;
					int tmpa = j; int tmpb = k;
					for(la = 0; tmpa > 0; tmpa/=10)la++;
					for(lb = 0; tmpb > 0; tmpb/=10)lb++;
										
					tmpa = j; tmpb = k;

					while(lb>0){
						tmpa*=10; lb--;
					}
					while(la>0) {
						tmpb*=10; la--;
					}	
										
					if(tmpa+k != tmpb+j && tmpa+k >= a && tmpa+k <= b && tmpb+j >= a && tmpb+j <= b){ 
						int lp = al.indexOf(tmpa+k);
						if(lp > 0 && al.get(lp-1) == tmpb+j) {
							
						} else {
							al.add((tmpa+k));
							al.add((tmpb+j));
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+(al.size()/2));
		}
	}
}
