import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package se.pathed.codejam.practice.recycled;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

public class RecycledNumbers {

	public static void main(String[] args) throws NumberFormatException, IOException{
		new RecycledNumbers().run();
	}


	public File getFileFromDisk(String fileName){
		String dataFolder = "C:\\Users\\Patrik\\workspaces\\codejam\\Practis\\data\\";
		return new File(dataFolder + fileName);
	}
	
	public static class Problem {
		int first;
		int last;
	}
	
	public Problem[] parseInput() throws NumberFormatException, IOException{
		Problem[] probs;
		File f = getFileFromDisk("C-large.in");
		FileReader fReader = new FileReader(f);
		BufferedReader reader = new BufferedReader(fReader);
		
		int numCases = Integer.parseInt(reader.readLine());
		probs = new Problem[numCases];
		
		for(int i = 0; i < numCases; i++){
			String[] res = reader.readLine().split(" ");
			Problem p = new Problem();
			p.first = Integer.parseInt(res[0]);
			p.last = Integer.parseInt(res[1]);
			probs[i] = p;
		}
		
		reader.close();
		return probs;
	}
	
	private void run() throws NumberFormatException, IOException {
		Problem[] problems = parseInput();
		
		File outputFile = getFileFromDisk("out.txt");
		if( outputFile.exists()) outputFile.delete();
		PrintWriter outFile = new PrintWriter(outputFile);
		
		for(int i = 0; i < problems.length; i++){
			int solution = solve(problems[i]);
			outFile.println("Case #" + (i+1) + ": " + solution);
		}
		outFile.flush();
	}
	
	private int solve(Problem p){
		int first = p.first;
		int last = p.last;
		
		int count = 0;
		HashMap<Integer,Integer> found = new HashMap<Integer,Integer>();
		
		int[] foundInts = new int[Integer.toString(p.last).length() ]; 
		
		for(int x = first; x <= last; x++){
			String s = Integer.toString(x);
			int foundCount = 0;
			if(s.length() > 1){
				//System.out.println("Testing value: " + x);
				for(int v=1; v < s.length(); v++){
					String next = s.substring(v) + s.substring(0,v);
					//System.out.println("Testing value: " + next);
					if(next.charAt(0) != '0'){
						int val = Integer.parseInt(next);
						if( val <= last && val > x){
							// Already submitted
							boolean f = false;
							for(int i = 0; i < foundCount; i++){
								if( foundInts[i] == val){
									f = true;
								}
							}
							if(f != true){
								foundInts[foundCount] = val;
								foundCount++;
								if( found.containsKey(val) && found.get(val) == x){
									System.out.println("ERROR found duplicate: " + val);
									count++;
								}
								else {
									found.put(val, x);
									count++;
								}
							}
						}
					}
				}
			}
		}
		return count;
	}
}
