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.Hashtable;


public class C {
	

	ArrayList<String > result=new ArrayList<String>();
	
	public void op(String A,String B)
	{
		Hashtable<String , Boolean> tet=new Hashtable<String, Boolean>();
		long current_n;
		long current_m;
		int i_A=Integer.parseInt(A);
		long i_B=Integer.parseInt(B);
		long diff=i_B-i_A;
		long temp=i_A;
		String s;
		if(A.length()==1  && B.length()==1)
		{
			result.add(0+"");
			return;
		}
		for(int i=0;i<diff;i++)
		{
			current_n=temp;
			current_m=temp;
			s=current_m+"";
			for(int j=0;j<(current_n+"").length()-1;j++)
			{
				s=s.charAt(s.length()-1)+s.substring(0,s.length()-1);
				current_m=Integer.parseInt(s);
				if(current_m <= i_B && current_m > current_n && current_m >=i_A)
				{
					//System.out.println(current_n+"   "+current_m);
					tet.put(current_n+""+current_m, true);
				}
			}
			temp++;
		}
		//System.out.println(tet.size());
		result.add(tet.size()+"");
	}
	
	public void read_file() throws Exception {
		FileReader g = new FileReader("C-large.in");
		BufferedReader br = new BufferedReader(g);
		int No_of_Cases = Integer.parseInt(br.readLine());
		String s;
		String [] tete;
		for(int i=0;i<No_of_Cases;i++)
		{
			s=br.readLine();									// ha2ra el lines hena 
			tete=s.split(" ");
			op(tete[0],tete[1]);
		}
		g.close();
		write_file();
	}
	public void write_file() throws IOException
	{
		BufferedWriter br=new BufferedWriter(new FileWriter("test1.txt"));
		for(int i=0;i<result.size();i++)
		{
			br.write("Case #"+(i+1)+": "+result.get(i));
			if(i!=result.size()-1)
			{
				br.newLine();
			}
		}
		br.close();
	}
	
	
	public static void main (String [] args) throws Exception
	{
		C t=new C();
		t.read_file();
	}

}
