/*
 * 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.util.ArrayList;
import java.util.Scanner;


public class Recycle2 {

	
	private static int solve(int L, int H) {
		class Slice {
			int L,H,mul,dig;
			Slice(int LL,int HH,int Mull,int digg) {
				L=LL; H=HH; mul=Mull; dig=digg;
			}
			public String toString() { return String.format("%d-%d, %d(%d)", L,H,mul,dig); }
		}
			
		ArrayList<Slice> slices = new ArrayList<Slice>();
			
		int k = 10, d=1;
		int l = L, h=H;
		while(true) {
			if (l>=k) {
				k*=10;d++;
				continue;
			}
			if (h<k) {
				slices.add( new Slice(l,h,k/10,d));
				break;
			} else {
				slices.add( new Slice(l,k-1,k/10,d));
				l=k;
				k=k*10;d++;
				continue;
			}
		}
		
		class Pair {
			int i,j;
			Pair(int ii,int jj) {i=ii;j=jj;}
			boolean equal(Pair p) {
				return p.i==i && p.j==j;
			}
			public String toString() { return String.format("(%d,%d)",i,j); }
		}
		
		ArrayList<Pair> ps = new ArrayList<Pair>();
		
		int ret = 0;
		//System.out.println(slices);
		for(Slice slice:slices) {
			for(int i=slice.L; i<=slice.H; i++) {
				int n=i;
				ArrayList<Integer> past = new ArrayList<Integer>();
				for (int j=0;j<(slice.dig-1);j++) {
					int dd=n%10;
					n=(n/10)+dd*slice.mul;
					if (n>i && n<=slice.H && !past.contains(n)) {
						//System.out.println("checking (" + i + ", " + n + ")");
						/*Pair p=new Pair(i,n);
						for(Pair c:ps) {
							if (c.equal(p)) {
								System.out.println("Duplicate: " + p);
							}
						}
						ps.add(p);*/
						ret++;
						past.add(n);
					}
				}
				
			}
		}
	
		return ret;
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int t=1;t<=T;t++) {
			int L = in.nextInt();
			int H = in.nextInt();
			System.out.printf("Case #%d: %d%n", t, solve(L,H));
		}

	}

}
