/*
 * 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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.Set;

public class Evans2012C {
	private final String _PROBLEM_NO = "201201C";
	private final String _FILE_DIRECTORY = "K:/Dropbox/workspace/codejam/" + _PROBLEM_NO + "/";
	private final String _FILE_PATH = _FILE_DIRECTORY + "C-Large";
	
	public static void main(String[] args) throws IOException {
		Locale.setDefault(Locale.US);
		new Evans2012C().execute();
	}

	public void execute() {
		BufferedReader br = null;
		PrintWriter pw = null;

		try {
			br = new BufferedReader(new FileReader(_FILE_PATH + ".in"));
			pw = new PrintWriter(_FILE_PATH + ".out");
			 
			//main
			int caseno = Integer.parseInt(br.readLine());
			Map<Integer,List> m = new HashMap<Integer,List>();
			
			for(int i=10;i<=1000000;i++) {
				check(i,m);	
			}
//			System.out.println(m.get(2));
			for (int count = 1; count <= caseno; count++) {
//				if(count>4)break;
				pw.print("Case #" + count + ": ");
				System.out.print("Case #" + count + ": ");
				
				String line = br.readLine();
				
				String[] splits = line.split(" ");
				int A = Integer.parseInt(splits[0]); 
				int B = Integer.parseInt(splits[1]); 
					 
				int r = 0;
				
				if(A < 10 || A >= 1000000 || A==B) {
					pw.print("0");
					System.out.print("0"); 
				}
				else {
					List<Integer> tt = m.get((""+A).length());
					for(int t:tt) {

//						if(t >= A && t <= B) {
							r += check(A,B,t);
//						}
					}
					pw.print(r);
					System.out.print(r);
				}
				
				pw.print("\n");
				System.out.print("\n");
			}
			
			//end
	
	
			br.close();
			pw.close();
		
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		finally {
			try {
				if(pw != null) pw.close();
			} catch(Exception e) {}
			try {
				if(br != null) br.close();
			} catch(Exception e) {}
		}
	}

	private int check(int a, int b, int t) {
		String tt = ""+t;
//		System.out.println(tt);
		int r =0;
		Set<Integer> rr = new HashSet<Integer>();  
		for(int i=0;i<tt.length();i++) {
			if(i!=0) {
				tt = tt.substring(1) + tt.charAt(0);
				if(tt.startsWith("0")) continue;

				t = Integer.parseInt(tt);
				
				
			}
			if(t>=a&&t<=b) {
//				System.out.print(tt + "!");
				rr.add(t);
				
			}
		}
		r=rr.size();
//		System.out.println(r);
		if(r==1) return 0;
		
		
		
		if(r!=0) r = (r*(r-1))/2;
		
		return r;
	}

	private void check(int i, Map<Integer, List> m) {
 
		String in = "" + i;
		int b = in.length(); 
		
		if(!dedup(i)) return;
		
		dedup.put(i, true);
		
		List target = m.get(b);
		if(target == null) {
			target = new ArrayList<Integer>();
			m.put(b, target);
		}
		target.add(i);
	}
	 
	public static Map<Integer,Boolean> dedup = new HashMap<Integer,Boolean>();
 

	private boolean dedup(int t) {
		String tt = ""+t;


		for(int i=0;i<tt.length();i++) {
			if(i!=0) {
				tt = tt.substring(1) + tt.charAt(0);
				if(tt.startsWith("0")) continue;
				 
				t = Integer.parseInt(tt);
				 
			}
			 
			if(dedup.get(t) != null)
				return false;
		}
 
		return true;
	}
	
}
