/*
 * 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.util.ArrayList;
import java.util.List;

public class Third {

	int left;
	int right;
	int[][] working;

	public Third(int left, int right) {
		this.left = left;
		this.right = right + 1;

	}

	public static void main(String[] args) throws IOException {

		List<String> result = new ArrayList<>();

		List<String> input = FileRW.readFile("input.txt");

		for (String inp : input) {
			String[] range = inp.split(" ");
			result.add(new Third(Integer.valueOf(range[0]), Integer.valueOf(range[1])).process());
		}
		
		FileRW.writeOutput("output.txt", result);
	}

	public String process() throws IOException {

		int total = right - left;

		working = new int[total][total];

		for (int i = 0; i < working.length; i++) {
			char[] cur = deriveArr(left + i);
			for (int j = i + 1; j < working.length; j++) {
				char[] next = deriveArr(left + j);
				if (next.length > cur.length) {
					working[i][j] = -1;
					break;
				}
				if (compare(cur, next)) {
					working[i][j] = 1;
					working[j][j] = -1;
				}
			}
		}
		int result = 0;

		for (int i = 0; i < working.length; i++) {
			// if (working[i][i] == -1) {
			// continue;
			// }
			int j = i + 1;
			while (j < working[i].length && working[i][j] != -1) {
				result += working[i][j];
				j++;
			}
		}

		return "" + result;
	}

	public boolean compare(char[] cur, char[] next) {
		int start = findIndex(cur[0], next, -1);
		outer: while (start != -1) {
			int loop = start;
			for (int i = 0; i < cur.length; i++) {
				if (loop >= cur.length) {
					loop = 0;
				}
				if (cur[i] != next[loop]) {
					start = findIndex(cur[0], next, start);
					continue outer;
				}
				loop++;
			}
			return true;
		}
		return false;
	}

	private int findIndex(char c, char[] next, int from) {
		for (int i = from + 1; i < next.length; i++) {
			if (c == next[i]) {
				return i;
			}
		}
		return -1;
	}

	public char[] deriveArr(int i) {
		char[] digits = String.valueOf(i).toCharArray();
		return digits;
	}
}
