/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class RecycledNumbers {
	
	public static void main(String[] argv) throws Exception {
//		Scanner s = new Scanner(System.in);
		Scanner s = new Scanner(new FileInputStream("RecycledNumbers/C-large.in"));
		PrintWriter pw = new PrintWriter(new FileOutputStream("RecycledNumbers/C-large.out"));
//		PrintWriter pw = new PrintWriter(System.out);
		
		int T = s.nextInt();
		for(int i=1;i<=T;i++) {
			int A = s.nextInt();
			int B = s.nextInt();
			Set<Integer> checked = new HashSet<Integer>();
			int numDigit = Integer.toString(A).length();
			int pairs = 0;
			for(int j = A; j<=B; j++) {
				if(checked.contains(j)) continue;
				checked.add(j);
				int[] digits = new int[numDigit];
				for(int k = 0;k < numDigit;k++) {
					digits[k] = (j / powers[k]) - (j / powers[k+1])*10;
				}
//				System.out.println(Arrays.toString(digits));
				int count =0;
				for(int k =1; k< numDigit;k++ ){
					shift(digits);
					int newnum = 0;
					for(int l=0;l<numDigit;l++) {
						newnum += digits[l]*powers[l];
					}
					if(!checked.contains(newnum)) {
						checked.add(newnum);
						if(newnum >= A && newnum <=B) {
							count++;
						}
					}
				}
				if(count >= 1) {
					pairs += (count+1)*(count)/2;
				}				
			}
			pw.println("Case #" + i +": " + pairs);
			System.out.println("Case #" + i +":" +pairs);
		}
		pw.flush();
		pw.close();
	}
	static int[] powers = new int[8];

	static 
	{
		for(int j=0;j<powers.length;j++) {
			powers[j] = pow(10,j);	
		}

	}
	static int pow(int a, int b) {
		if(b == 1) return a;
		if(b == 0) return 1;
		if(b%2 == 0) {
			int r = pow(a,b/2);
			return r*r;
		} else {
			return pow(a,b-1)*a;
		}
	}
	private static void shift(int[] digits) {
		int tmp = digits[0];
		for(int i=0;i<digits.length-1;i++) {
			digits[i] = digits[i+1];
		}
		digits[digits.length-1] = tmp;
	}

}
