package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class prob2 {
	private static long oneTest(int a, int b){
		boolean [] bool=new boolean[b+1];
		long res=0;
		for(int i=a; i<=b; i++){
			if(bool[i]) continue;
			res+=pairs(i, bool, a, b);
		}
		return res;
	}
	private static long pairs(int j, boolean []bool, int a, int b){
		String str=Integer.toString(j);
		int len=str.length();
		TreeSet<Integer> set=new TreeSet<Integer>();
		for(int i=0; i<=str.length(); i++){
			int c=Integer.parseInt(str);
			if(Integer.toString(c).length()!=len||(c<a||c>b)) {
				str=str.substring(len-1)+str.substring(0,len-1);
				continue;
			}
			str=str.substring(len-1)+str.substring(0,len-1);
			bool[c]=true;
			set.add(c);
			
		}
		long res=set.size();
		res*=(set.size()-1);
		res/=2;
		return res;
	}
	public static void main(String args[]) throws IOException{
		PrintWriter out=new PrintWriter(new FileWriter("result.txt"));
		BufferedReader in=new BufferedReader(new FileReader("C-large.in"));
		//BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
	//	System.out.print(oneTest(10, 40));
		int n=Integer.parseInt(in.readLine());
		for(int i=1; i<=n; i++){
			String str=in.readLine();
			out.print("Case #"+i+": ");
			StringTokenizer tok=new StringTokenizer(str);
			out.print(oneTest(Integer.parseInt(tok.nextToken()), Integer.parseInt(tok.nextToken())));
			out.println();
			System.out.println(i);
		}
		
		out.flush();
		System.out.println("over");
		
	}
}
