import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package se.pathed.codejam.practice.recycled;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

public class RecycledNumbers {

	public static void main(String[] args) throws NumberFormatException, IOException{
		new RecycledNumbers().run();
	}


	public File getFileFromDisk(String fileName){
		String dataFolder = "C:\\Users\\Patrik\\workspaces\\codejam\\Practis\\data\\";
		return new File(dataFolder + fileName);
	}
	
	public static class Problem {
		int first;
		int last;
	}
	
	public Problem[] parseInput() throws NumberFormatException, IOException{
		Problem[] probs;
		File f = getFileFromDisk("C-large.in");
		FileReader fReader = new FileReader(f);
		BufferedReader reader = new BufferedReader(fReader);
		
		int numCases = Integer.parseInt(reader.readLine());
		probs = new Problem[numCases];
		
		for(int i = 0; i < numCases; i++){
			String[] res = reader.readLine().split(" ");
			Problem p = new Problem();
			p.first = Integer.parseInt(res[0]);
			p.last = Integer.parseInt(res[1]);
			probs[i] = p;
		}
		
		reader.close();
		return probs;
	}
	
	private void run() throws NumberFormatException, IOException {
		Problem[] problems = parseInput();
		
		File outputFile = getFileFromDisk("out.txt");
		if( outputFile.exists()) outputFile.delete();
		PrintWriter outFile = new PrintWriter(outputFile);
		
		for(int i = 0; i < problems.length; i++){
			int solution = solve(problems[i]);
			outFile.println("Case #" + (i+1) + ": " + solution);
		}
		outFile.flush();
	}
	
	private int solve(Problem p){
		int first = p.first;
		int last = p.last;
		
		int count = 0;
		HashMap<Integer,Integer> found = new HashMap<Integer,Integer>();
		
		int[] foundInts = new int[Integer.toString(p.last).length() ]; 
		
		for(int x = first; x <= last; x++){
			String s = Integer.toString(x);
			int foundCount = 0;
			if(s.length() > 1){
				//System.out.println("Testing value: " + x);
				for(int v=1; v < s.length(); v++){
					String next = s.substring(v) + s.substring(0,v);
					//System.out.println("Testing value: " + next);
					if(next.charAt(0) != '0'){
						int val = Integer.parseInt(next);
						if( val <= last && val > x){
							// Already submitted
							boolean f = false;
							for(int i = 0; i < foundCount; i++){
								if( foundInts[i] == val){
									f = true;
								}
							}
							if(f != true){
								foundInts[foundCount] = val;
								foundCount++;
								if( found.containsKey(val) && found.get(val) == x){
									System.out.println("ERROR found duplicate: " + val);
									count++;
								}
								else {
									found.put(val, x);
									count++;
								}
							}
						}
					}
				}
			}
		}
		return count;
	}
}
