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.*;
import java.util.Scanner;
import java.util.*;

public class B {
	public static int reverse(int a, int b) {
		Vector vec = new Vector();
		Vector vec2 = new Vector();
		int result = 0;
		if(a > 9) {
			for(int i=a; i <= b; i++) {
				String x=i+"";
				for(int j = 1; j < x.length();j++) {
					int status = 0;
					String p =(x.substring(j,x.length()))+x.substring(0,j);
					int num2 = Integer.parseInt(p);
					if(i!=num2 && num2 <= b && num2 >=a) {
						//System.out.println("P VALUE >> " + p);
						//System.out.println("INDEX OF"+x+" : "+vec.indexOf(x));
						for(int k = 0; k < vec.size(); k++) {
							String tmp = (String) vec.elementAt(k);
							String tmp2 = (String) vec2.elementAt(k);
							int c = Integer.parseInt(tmp);
							int d = Integer.parseInt(tmp2);
							if((c == num2 && i == d) || (c==i && d == num2)) {
								status = 1; break;
							}
						}
						if(status == 0) {
							vec.add(x);
							vec2.add(p);
							//System.out.println(">>>"+x+" "+p);
							result++;
						}
					}
				}
			}
		}
		return result;
	}
	
	public static void main(String [] args) {
		File fFile = new File("B.in");
		Scanner scanner = null;
    	try {
    		scanner = new Scanner(new FileReader(fFile));
      		//first use a Scanner to get each line
      		int line = 1;
      		while ( scanner.hasNextLine() ){
        		String name = scanner.nextLine();
        		String []x = name.split(" ");
        		int p1 = Integer.parseInt(x[0]);
        		int p2 = Integer.parseInt(x[1]);
        		System.out.println("Case #"+line+": "+reverse(p1,p2));
        		line++;
      		}
    	}
    	catch(Exception ex) {
    	}
    	finally {
      		scanner.close();
    	}
	}
}