import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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


public class ProblemaC {
	
	private final static String RUTA="C:/Users/Rafael/Documents/Estudio/OtherStuff/Google/CodeJam/ProblemaC/";
	
	public ProblemaC(){
		try {
			FileOutputStream fos=new FileOutputStream(new File(RUTA+"resultado.txt"));
			BufferedReader br=new BufferedReader(new FileReader(RUTA+"C-small-attempt3.in"));
			PrintWriter pw=new PrintWriter(fos);
			
			String a=br.readLine();
			System.out.println("Ignore"+a);
			int contador=0;
			while((a=br.readLine())!=null)
			{
				contador++;
				System.out.println("Case #"+contador+": "+a);
				String first=a.split(" ")[0];
				String second=a.split(" ")[1];
				int temp=analizar(first, second);
				System.out.println(temp);
				pw.println("Case #"+contador+": "+temp );
			}
			pw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public int analizar(String first, String second ){
		ArrayList<String> dupList=new ArrayList<String>();
		int contador=0;
		int primero=Integer.parseInt(first);
		int segundo=Integer.parseInt(second);
		for(int i=primero;i<=segundo;i++){
			for(int j=i+1;j<=segundo;j++){
				for(int k=1;k<first.length();k++){
					String uno=""+i;
					String dos=""+j;
					String fm=convert(k, uno);
					if(fm.equals(dos)&&!dupList.contains(uno+"-"+dos))
					{
						if(uno.startsWith("0")||dos.startsWith("0")){						
							System.out.println(uno+"-"+dos);
						}
//						System.out.println(uno+","+dos);
						contador++;
						dupList.add(uno+"-"+dos);
					}
				}
			}
		}
		return contador;
	}
	
	public String convert(int k, String primero){
		String acumulador="";
		for(int i=0;i<k;i++)	
		{
			acumulador=primero.charAt(primero.length()-1)+acumulador;
			primero=primero.substring(0, primero.length()-1);
		}
		primero=acumulador.concat(primero);
		
		return primero;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
			new ProblemaC();
	}
}
