import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.*;
import java.util.ArrayList;
import java.util.List;

public abstract class JamProblem {

    int caseCount;
    int lastLine;

    abstract String solveCase(JamCase jamCase);
    abstract JamCase parseCase(List<String> file, int line);
    List<String> loadFile() throws IOException {
        FileReader inputStream = new FileReader("C:\\projekt\\codejam\\src\\input.txt");
        BufferedReader reader = new BufferedReader(inputStream);
        List<String> list = new ArrayList<String>();
        while (true) {
            String line = reader.readLine();
            if (line == null) {
                break;
            }
            list.add(line);
        }
        return list;
    }

    void go() throws IOException {
        List<String> file = loadFile();


        parseFirstLine(file);
        FileWriter writer = new FileWriter("C:\\projekt\\codejam\\src\\otput.txt");
        for (int c=0; c< caseCount; c++) {
            JamCase casee= parseCase(file, lastLine);
            lastLine += casee.lineCount;
            String s = solveCase(casee);
            writer.write("Case #" + (c+1) +": " + s + "\n");
        }
        writer.close();
    }

    void parseFirstLine(List<String> file) {
        int[] firstLine = JamUtil.parseIntList(file.get(0), 1);
        this.caseCount = firstLine[0];
        lastLine = 1;
    }
}
