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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.HashSet;
import java.util.List;
import java.util.Set;


public class Recycled {
	
	public static void main(String[] args) throws IOException {
		Path input = Paths.get("/Users/mdymczyk/google-codejam/Tongues/src/input.in");
		List<String> lines = Files.readAllLines(input, Charset.forName("UTF-8"));
		lines.remove(0);
		int i = 1;
		for(String line : lines) {
			Set<Pair> pairs = new HashSet<Pair>();
			StringBuilder sb = new StringBuilder();
			sb.append("Case #"+i+": ");
		
			int lower = Integer.parseInt(line.split(" ")[0]); 
			int upper = Integer.parseInt(line.split(" ")[1]); 
			int length = line.split(" ")[0].length();
			
			for(int j = lower ; j <= upper ; j++) {
				for(int k = 1; k < length; k++) {
					int rearranged = rearrangeLastNDigits(j, k);
					if(rearranged != j && (rearranged >= lower && rearranged <= upper)){
						pairs.add(new Pair(j, rearranged));
					}
				}
			}
			sb.append(pairs.size());
			System.out.println(sb);
			i++;
		}
	}

	private static int rearrangeLastNDigits(int j, int k) {
		String stringRepresentation = Integer.toString(j);
		String reordered = stringRepresentation.substring(k, stringRepresentation.length()) + stringRepresentation.substring(0, k);
		return Integer.parseInt(reordered);
	}
	
}

class Pair {
	int n, m;

	public Pair(int n, int m) {
		this.n = n;
		this.m = m;
	}
	
	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * m*n;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		Pair other = (Pair) obj;
		if (m != other.m && m != other.n)
			return false;
		if (n != other.n && n != other.m)
			return false;
		return true;
	}
}
