/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
/**
 * 
 */
package hu.herba.codejam.cj2012.qualification;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

import hu.herba.codejam.AbstractCodeJamBase;

/**
 * Recycled Numbers
 * 
 * @author csorbazoli
 */
public class ProblemC extends AbstractCodeJamBase {

    public static void main(String[] args) {
	new ProblemC(args);
    }

    int T; // number of test case

    public ProblemC(String[] args) {
	super(args, AbstractCodeJamBase.READER_TYPE);
    }

    private boolean contains(String[] pairs, int found, String num) {
	boolean ret = false;
	for (int i = 0; i < found; i++) {
	    if (num.equals(pairs[i])) {
		// * TEST */System.out.println("  Pair already found before: " +
		// num);
		ret = true;
		break;
	    }
	}
	return ret;
    }

    private int countRecycled(int A, int B) {
	int result = 0, len;
	String strA = Integer.toString(A);
	String strB = Integer.toString(B);
	String orig, numbers, num;
	len = Integer.toString(A).length();
	String[] pairs = new String[len];
	int found;
	if (len > 1) {
	    for (int i = A; i <= B; i++) {
		orig = Integer.toString(i);
		numbers = orig + orig;
		found = 0;
		for (int j = 1; j <= len; j++) {
		    num = numbers.substring(j, j + len);
		    // each pair was counted twice
		    // if (!num.equals(orig) && (num.compareTo(strA) >= 0)
		    // &&
		    // (num.compareTo(strB) <= 0)) {
		    if ((num.compareTo(orig) > 0) && (num.compareTo(strA) >= 0) && (num.compareTo(strB) <= 0) && !this.contains(pairs, found, num)) {
			// *TEST*/ System.out.println("  " + orig +
			// " recycled with " +
			// num);
			pairs[found++] = num;
			result++;
		    }
		}
	    }
	}
	// *TEST*/System.out.println(" result: " + result);
	return result;
    }

    /*
     * (non-Javadoc)
     * 
     * @see hu.herba.codejam.AbstractCodeJamBase#process(java.io.BufferedReader,
     * java.io.PrintWriter)
     */
    @Override
    protected void process(BufferedReader reader, PrintWriter pw) throws IOException, IllegalArgumentException {
	// The first line of the input gives the number of test cases, T. T test
	// cases follow, one per line.
	// Each test case consists of a single line containing the integers A
	// and B.
	this.T = this.readInt(reader, "Number of cases");
	int[] items;
	for (int i = 1; i <= this.T; i++) {
	    items = this.readIntArray(reader, "testCase");
	    if (items.length == 2) {
		if (Integer.toString(items[0]).length() != Integer.toString(items[1]).length()) {
		    System.out.println("Test case " + i + " INVALID: A and B has different length - " + Arrays.toString(items));
		}
		// * TEST */System.out.println("Case #" + i + ": input = " +
		// Arrays.toString(items));
		// For each test case, output one line containing "Case #x: y",
		// where x is the case number (starting from 1), and y is the
		// number of recycled pairs (n, m) with A â¤ n < m â¤ B.
		pw.println("Case #" + i + ": " + this.countRecycled(items[0], items[1]));
	    } else {
		System.out.println("Test case " + i + " INVALID: test case should contain 2 integers A, B with same length" + Arrays.toString(items));
	    }
	}
    }
}
