import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

/**
 * Google CodeJam 2012
 * Qualification round - Problem C
 * Recycled Numbers
 * 
 * Solved by Üllar Soon <positivew@gmail.com>
 */
package eu.positivew.codejam.recycled;

import java.io.File;
import java.util.ArrayList;

import eu.positivew.codejam.framework.CodeJamIO;


/**
 * Recycled Numbers main class.
 * 
 * @author Üllar Soon <positivew@gmail.com>
 */
public class RecycledNumbersMain {

	/**
	 * Main controller for RecycledNumbers.
	 * 
	 * @param args 		Command line arguments
	 */
	public static void main(String[] args) {
		// Parse command line arguments
		String inUrl = "input.txt";
		String outUrl = "output.txt";
		if(args.length >= 1)
			inUrl = args[0];
		if(args.length >= 2)
			outUrl = args[1];
		
		
		File inFile = new File(inUrl);
		File outFile = new File(outUrl);
		
		CodeJamIO cio = new CodeJamIO();
		
		cio.inputOpen(inFile);
		cio.outputOpen(outFile);
		
		if(cio.getTestCases() > 0) {
			RecycledNumbersCase inCase;
			int i = 0;
			while(i < cio.getTestCases() && (inCase = (RecycledNumbersCase)cio.inputReadCase(new RecycledNumbersParser())) != null) {
				cio.outputWriteCase("" + countRecycledNumbers(inCase.getA(), inCase.getB()));
				i++;
			}
		}
		
		cio.inputClose();
		cio.outputClose();
	}
	
	/**
	 * Counts the distinct occurring pairs of recycled numbers between A and B (inclusive).
	 * 
	 * @param A		left limiter
	 * @param B		right limiter
	 * @return		number of distinct recycled numbers between A and B
	 */
	private static int countRecycledNumbers(int A, int B) {
		int count = 0;
		ArrayList<IntPair> foundPairs = new ArrayList<IntPair>();
		
		for(int i = A; i <= B; i++) {
			String nStr = "" + i;
			
			for(int j = 1; j < nStr.length(); j++) {
				String mStr = nStr.substring(j) + nStr.substring(0, j);
				
				if(mStr.charAt(0) == '0')
					continue;
				
				try {
					int n = Integer.parseInt(nStr);
					int m = Integer.parseInt(mStr);
					
					if(A <= n && n < m && m <= B) {
						if(!foundPairs.contains(new IntPair(n, m))) {
							foundPairs.add(new IntPair(n, m));
							count++;
						}
					}
				}
				catch(NumberFormatException ex) {
					System.err.println("Number conversion error!");
				}
			}
		}
		
		return count;
	}

}
