/*
 * 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");
    }

}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class Main {
	public static void main(String[] args) {
		File inputFile = new File("input.txt");
		BufferedReader br = null;
		FileOutputStream out = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
			String line;
			line = br.readLine();
			if (line == null) {
				throw new IllegalStateException("Empty input file!!!");
			}
			
			
			StringBuilder result = new StringBuilder();
			
			int length = Integer.parseInt(line), i = 1;
			while (i <= length) {
				result.append("Case #").append(i).append(": ");
///////////////////////////////////////////////////////////////////////////////////////////////////

				Set<String> match = new HashSet<String>();
				String[] numbers = br.readLine().split(" ");
				int n = Integer.parseInt(numbers[0]);
				int m = Integer.parseInt(numbers[1]);
				for (int j = n;j < m; j++) {
					String num = j + "";
					char[] charArray = num.toCharArray();
					if (num.length() < 2 || isCharsEqual(charArray)) {
						continue;
					}
					
					addMatches(charArray, n, m, match);
				}
				result.append(match.size());
				
///////////////////////////////////////////////////////////////////////////////////////////////////
				result.append("\n");
				i++;
			}
			
			File outputFile = new File("output.txt");
			outputFile.delete();
			outputFile.createNewFile();
			
			out = new FileOutputStream(outputFile);
			out.write(result.toString().getBytes());
	} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (br != null) {
				try {
					br.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			
			if (out != null) {
				try {
					out.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}
	}
	
	private static boolean isCharsEqual(char[] num) {
		char c = num[0];
		for (int i = 1; i < num.length; i++) {
			if (c != num[i]) {
				return false;
			}
		}
		
		return true;
	}
	
	private static void addMatches(char[] num, int lower, int upper, Set<String> match) {
		String n = new String(num);
		char[] tmp = spin(num);
		
		for (int i = 1; i < num.length; i++) {
			if (tmp[0] != '0') {
				int m = Integer.parseInt(new String(tmp));
				String key = genKey(n, "" + m);
				if (lower <= m && m <= upper && !n.equals(m + "") && !match.contains(key)) {
					match.add(key);
				}
			}
			tmp = spin(tmp);
		}
	}
	
	private static char[] spin(char[] source) {
		char[] target = new char[source.length];
		for (int i = 1; i < source.length; i++) {
			target[i] = source[i - 1];
		}
		target[0] = source[source.length - 1];
		return target;
	}
	
	private static String genKey(String n, String m) {
		if (n.compareTo(m) < 0) {
			return n + "|" + m;
		} else 
			return m + "|" + n;
	}
}
