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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class RecycledNumbers {
	public RecycledNumbers() {
		// System.out.println(getBits(1123242));
		BufferedReader in = null;
		PrintWriter out = null;
		try {
			in = new BufferedReader(new FileReader("small.in"));
			out = new PrintWriter(new FileWriter("small.out"));
		} catch (Exception e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		try {
			int T = Integer.parseInt(in.readLine());
			int result = 0;
			for (int group = 0; group < T; group++) {
				System.out.println("-------------" + group + "-----------");
				String line = in.readLine();
				StringTokenizer st = new StringTokenizer(line);
				long A = Long.parseLong(st.nextToken());
				long B = Long.parseLong(st.nextToken());
				result = getPairs(A, B);
				// System.out.println(Long.MIN_VALUE);
				int inn = group + 1;
				String target = "Case #" + inn + ": " + result;
				out.println(target);
			}
		} catch (NumberFormatException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}

		try {
			in.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		out.close();
	}

	private int getPairs(long A, long B) {
		// TODO Auto-generated method stub
		int result = 0;
		long n;
		int temp;
		for (long i = A; i < B; i++) {
			n = i;
			temp = hasRecycle(n, B);
			result = result + temp;
		}
		return result;
	}

	private int hasRecycle(long nn, long B) {
		// TODO Auto-generated method stub
		// m>n;
		// same length;
		// distinct.
		String m;
		String n = nn + "";
		long mm;
		int mP;
		int nP;
		int result = 0;
		long[] cmm = new long[7];
		int cmmMAX = 0;
		for (int i = 1; i < n.length(); i++) {
			m = shift(n, i);
			mm = Long.parseLong(m);
			mP = getBits(mm);
			nP = getBits(nn);
			// System.out.println(nn + "," + mm);
			if (mP == nP && nn < mm && mm <= B) {
				if (notInclude(cmm, cmmMAX, mm)) {
					System.out.println(nn + "," + mm);
					cmm[cmmMAX++] = mm;
					result++;
				}
			}
		}
		return result;
	}

	private boolean notInclude(long[] cmm, int cmmMAX, long mm) {
		// TODO Auto-generated method stub
		for (int i = 0; i < cmmMAX; i++) {
			if (cmm[i] == mm)
				return false;
		}
		return true;
	}

	private int getBits(long mm) {
		// TODO Auto-generated method stub
		int result = 1;
		while (mm / 10 > 0) {
			result++;
			mm = mm / 10;
		}
		return result;
	}

	private String shift(String n, int i) {
		// TODO Auto-generated method stub
		return n.substring(i) + n.substring(0, i);
	}

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