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

package year_2012.qualification;

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.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


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

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.util.StringTokenizer;


public class Numbers {

	final static String INPUT = "50\n" + 
"103 968\n" + 
"150 975\n" + 
"122 949\n" + 
"129 936\n" + 
"120 979\n" + 
"532 532\n" + 
"100 101\n" + 
"171 913\n" + 
"129 974\n" + 
"162 954\n" + 
"113 964\n" + 
"109 930\n" + 
"190 916\n" + 
"175 941\n" + 
"131 971\n" + 
"117 916\n" + 
"185 986\n" + 
"118 595\n" + 
"170 958\n" + 
"162 913\n" + 
"125 944\n" + 
"218 986\n" + 
"176 925\n" + 
"152 956\n" + 
"100 999\n" + 
"179 947\n" + 
"387 387\n" + 
"166 958\n" + 
"148 990\n" + 
"70 99\n" + 
"183 920\n" + 
"100 999\n" + 
"144 965\n" + 
"123 954\n" + 
"2 3\n" + 
"105 958\n" + 
"122 980\n" + 
"40 62\n" + 
"114 954\n" + 
"185 974\n" + 
"126 992\n" + 
"190 936\n" + 
"497 884\n" + 
"100 100\n" + 
"109 972\n" + 
"178 980\n" + 
"137 962\n" + 
"106 997\n" + 
"147 954\n" + 
"188 981\n";
	
	public static void main(final String argv[]) throws NumberFormatException, Exception {
		StringTokenizer st = new StringTokenizer(INPUT);
		
		final int testCases = Integer.parseInt(st.nextToken());
		
		for(int i = 0; i < testCases; i++) {
			System.out.println("Case #"+(i+1)+": " + 
					solve(Integer.parseInt(st.nextToken()), 
							Integer.parseInt(st.nextToken())));
		}
	}


	private static int solve(final int A, final int B) throws Exception {
		if(A < 10) {
			return 0;
		} else {
			int result = 0;

			final int digits = Integer.toString(A).length();	
			for(int n = A; n < B; n++) {
				
				for(int shifts = 0; shifts < (digits - 1); shifts++) {
					byte [] numB = new byte[digits];
					toByteArr(n, numB);
					shift(numB, shifts + 1);
					int m = toInt(numB);
					if(m > n && m <= B) {
						//System.out.println(i + " " + tmpNr);	
						result++;
						if(numB[0] == 0) throw new Exception("a");
					}
				}
			}
			return result;
		}
	}
	
	private static void shift(byte[] numB, int positions) {
		
		byte [] tmp = new byte[positions];
		for(int i = 0; i < positions; i++) {
			tmp[i] = numB[numB.length - (positions - i)];
		}
		
		for(int i = numB.length - 1; i > (positions - 1); i--) {
			numB[i] = numB[i-positions];
		}
		
		for(int i = 0; i < positions; i++) {
			numB[i] = tmp[i];
		}
	}


	private static byte [] toByteArr(int nr, byte [] arr) {
		char [] chars = Integer.toString(nr).toCharArray();
		
		
 		for(int i = 0; i < arr.length; i++) {
			arr[i] = (byte) (chars[i] - 48);
		}
		return arr;
	}
	
	private static int toInt(byte [] arr) {
		int result = 0;
		for(int i = 0; i < arr.length; i++) {
			result += arr[i] * (int)Math.pow(10, arr.length - 1 - i);
		}
		return result;
	}
}
