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;
	}

}

package com.google.codejam.p3;

import java.awt.Point;
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Problem3 {

	ArrayList<Point> cases = new ArrayList<Point>();

	public void loadInput() {
		try{
			FileInputStream fstream = new FileInputStream("input3.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = br.readLine(); //read number of lines
			while ((strLine = br.readLine()) != null) {
				String[] info = strLine.split(" ");
				int A = Integer.parseInt(info[0]);
				int B = Integer.parseInt(info[1]);
				cases.add(new Point(A,B));
			}
			in.close();
		}
		catch (Exception e) { }
	}
	
	public static boolean isRecycled(int a, int b) {

		String s1 = Integer.toString(a);
		String s2 = Integer.toString(b);
		for (int i=0; i<s1.length(); i++) {
			String tmpS = s2.substring(0, s2.length()-1); 
			char lastC = s2.charAt(s2.length()-1);
			s2 = lastC + tmpS;
			if (s2.equals(s1))
				return true;
		}
		return false;
	}
	
	public void getOutput() {
		for (int x=0; x<cases.size(); x++) {
			int A = cases.get(x).x;
			int B = cases.get(x).y;
			int total = 0;
			for (int i=A; i<B; i++) 
				for (int j=i+1; j<=B; j++)
					if (isRecycled(i, j))
						total++;
			System.out.println("Case #" + (x+1) + ": " + total);
		}
	}
	
	
	public static void main(String[] args) {
		Problem3 p = new Problem3();
		p.loadInput();
		p.getOutput();
	}

}
