package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;


public class C {
    public static void main(String args[]){
    	String fn="C:\\codejam\\C.in";
        String fnOut="C:\\codejam\\C.out";
try{
	BufferedReader br = new BufferedReader(new FileReader(fn));
	BufferedWriter bw = new BufferedWriter(new FileWriter(fnOut));
	String line = null;
	int NCase = Integer.valueOf(br.readLine().trim());
	long stime = System.currentTimeMillis();
	for(int icase=0;icase<NCase;icase++){
		String[] a = toStringArray(br.readLine());
		int buf = procesar(a);
		String out = "Case #"+(icase+1)+": "+buf;
		bw.write(out,0,out.length());
		bw.newLine();
		long ctime = System.currentTimeMillis();
                        System.out.println(out);
		//System.out.println(String.format("--- Done: #%2d,%3.0fs, ends in:%2.1fm",(icase+1),(ctime-stime)*0.001,(ctime-stime)*0.001/60*NCase/(icase+1)));
	}
	br.close();
	bw.close();
}catch(IOException ex){
	System.out.println(ex);
}
    	
    }
    
    
    
    static String[] toStringArray(String line){
        String[] p = line.trim().split("\\s+");
        //int[] out = new int[p.length];
        //for(int i=0;i<out.length;i++) out[i] = Integer.valueOf(p[i]);
        return p;
}



	static public int procesar(String nums[]){
    	int x = 0;
    	long A = new Long(nums[0]);
    	long B = new Long(nums[1]);

    	for(long i = A; i<= B; i++){
    		
    		List<Long> num = new ArrayList<Long>();
    		
    		for(long j = 1; j<(new Long(A).toString()).length(); j++){
    			
    			long p1 = (long) (i/(Math.pow(10,j)));
    			long p2 = (long) (i%(Math.pow(10,j)));
    			long pn = new Long(p2+""+p1);
    			//System.out.println("Aca " + pn );
    			if(pn>i&&pn<=B){
    				if(!num.contains(pn)){
    					num.add(pn);
    					x++;
    				}
    				System.out.println(x + " - " + i +  ": " + pn);
    			}

    		}
    	}
    	return (x);
    }
}
