import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

package com.google.codejam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;



public class CRecycledNumbers {
	private void go() throws IOException {
		String fileIn = "resources/codejam2012/C-large.in";
		String fileOut = fileIn.replace(".in", ".out");
		
		BufferedWriter w = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(fileOut))); 
		
		BufferedReader r = new BufferedReader(new InputStreamReader(new FileInputStream(fileIn)));
		int count = Integer.parseInt(r.readLine());
		for(int i = 0; i < count; i++) {
			String out = processCase(r.readLine());
			out = "Case #" + (i + 1) + ": " + out;
			System.out.println(out);
			w.write(out + "\n");
		}		

		w.close();
		r.close();
	}
	

	private Set<Integer> getRecycled(int n) {
		Set<Integer> recycled = new HashSet<Integer>();
		
		String sn = String.valueOf(n);

		for(int i = 1; i < sn.length(); i++) {
			String newN = sn.substring(i) + sn.substring(0, i);
			if (!newN.startsWith("0") && !newN.equals(sn)) {
				recycled.add(Integer.parseInt(newN));
			}
		}
		
		return recycled;
	}
	
	private String processCase(String text) {
		Scanner scanner = new Scanner(text);
		int a = scanner.nextInt();
		int b = scanner.nextInt();

		int out = 0;
		
		for(int i = a; i < b; i++) {
			Set<Integer> recycled = getRecycled(i);
			for(Integer rec : recycled) {
				int r = rec;
				if ((r >i) && (r <= b)) out++;
			}
		}
		
		return String.valueOf(out);
	}



	public static void main(String[] args) throws Exception {
		long now = System.currentTimeMillis();
		new CRecycledNumbers().go();
		System.out.println(String.valueOf(System.currentTimeMillis() - now) + "ms");
	}
}