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 kjetil.codejam.qualification.recycled;

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

public class RecycledNumbers {

	private static final String INPUT_FILENAME = "input_recycled/C-large.in";
	private static final String OUTPUT_FILENAME = "output_files/recycled.out";

	static class Pair {
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + m;
			result = prime * result + n;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Pair other = (Pair) obj;
			if (m != other.m)
				return false;
			if (n != other.n)
				return false;
			return true;
		}

		private int n, m;
		
		Pair(int n, int m) {
			this.n = n;
			this.m = m;
		}

		public int getN() {
			return n;
		}

		public int getM() {
			return m;
		}
	}
	
	public static void main(String[] args) {

		try {

			FileWriter fstream = new FileWriter(OUTPUT_FILENAME);
			BufferedWriter out = new BufferedWriter(fstream);

			File file = new File(INPUT_FILENAME);
			BufferedReader reader = new BufferedReader(new FileReader(file));
			
			int numberOfTestCases = Integer.parseInt(reader.readLine());
			
			for (int i = 0; i < numberOfTestCases; i++) {
				String[] numberStrings = reader.readLine().split(" ");
				int a = Integer.parseInt(numberStrings[0]);
				int b = Integer.parseInt(numberStrings[1]);
				int numberOfRecycledPairs = getNumberOfRecycledPairs(a, b);
				out.write("Case #" + (i+1) + ": " + Integer.toString(numberOfRecycledPairs) +"\n");
			}
			
			out.close();
			reader.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	private static int getNumberOfRecycledPairs(int a, int b) {
		Set<Pair> pairs = new HashSet<Pair>();
		for (int n = a; n < b; n++) {
			String current = Integer.toString(n);
			for (int j = 1; j < current.length(); j++) {
				String sub = current.substring(j);
				if (sub.charAt(0) != '0') {
					int m = Integer.parseInt(sub+current.substring(0, j));
					if (n < m && m <= b ) {
						pairs.add(new Pair(n, m));
					}
				}
			}
		}
		return pairs.size();
	}
}

