import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package org.ivansopin.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.StringTokenizer;

public class RecycledNumbers {
	final static String fileName = "RecycledNumbers2";

	final static String inExtension = ".in";
	final static String outExtension = ".out";
	final static String source = fileName + inExtension;
	final static String destination = fileName + outExtension;

	static BufferedReader bufferedReader;
	static BufferedWriter bufferedWriter;
	static int counter;

	/* this is problem-specific */
	static int numOfCases;
	static int a, tmpA;
	static int b, tmpB;

	public static void main(String[] args) throws NumberFormatException, IOException, InterruptedException {
		bufferedReader = new BufferedReader(new FileReader(new File(source)));
		bufferedWriter = new BufferedWriter(new FileWriter(new File(destination)));

		numOfCases = Integer.parseInt(bufferedReader.readLine());

		Reader reader = new Reader();
		reader.start();
		reader.join();

		for (int i = 0; i < numOfCases; i++) {
			copyData();

			reader = new Reader();
			reader.start();

			/********* this is where the real logic starts **********/

			// at some point, the results should be printed:
			bufferedWriter.write("Case #" + (i + 1) + ": " + getNumOfRecNums(a, b) + "\n");
			

			/********** this is where the real logic ends ***********/

			if (reader.isAlive()) {
				reader.join();
			}
		}

		bufferedWriter.close();
		bufferedReader.close();
	}

	static int getNumOfRecNums(int a, int b) {
		boolean[] seen = new boolean[2000001];
		HashSet<Integer> set;
		int curNum;
		int size;
		int total = 0;
		
		for (int num = a; num <= b; num++) {
			if (!seen[num]) {
				set = new HashSet<Integer>();
				String numStr = num + "";
				int length = numStr.length() - 1;
			
				seen[num] = true;
				if (num >= a && num <= b)
					set.add(num);
				
				for (int i = 0; i < length; i++) {
					numStr = numStr.charAt(length) + numStr.substring(0, length);
					curNum = Integer.parseInt(numStr);
					if (curNum > 2000000)
						continue;
					seen[curNum] = true;
					if (curNum >= a && curNum <= b)
						set.add(curNum);
				}
				
				if ((size = set.size()) > 1) {
					total += (size * (size - 1) / 2);
				}
			}
		}
		
		return total;
	}
	
	static void copyData() {
		/* this is problem-specific */
		a = tmpA;
		b = tmpB;
	}

	static class Reader extends Thread {
		public Reader() {
		}

		@Override
		public void run() {
			String line;
			StringTokenizer tokenizer;

			try {
				if (counter < numOfCases) {
					/* this is problem-specific */
					line = bufferedReader.readLine();
					tokenizer = new StringTokenizer(line);
					
					tmpA = Integer.parseInt(tokenizer.nextToken());
					tmpB = Integer.parseInt(tokenizer.nextToken());

					counter++;
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}
}
