import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

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();
	}
}
