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.util.ArrayList;
import java.util.List;

import Utils.FileHelper;


public class Gcj2012c {
	
	

	private static String getPairCount(String str) {
		
		int A = Integer.parseInt( str.split(" ")[0] );
		int B = Integer.parseInt( str.split(" ")[1] );
		
		boolean [] used = new boolean [ B - A + 1];
		
		int size = (A +"").length();
		int rst = 0;
		
		for( int num = A ; num <= B; ++num){
			
			int curNum = num;
			
			int cnt = 0;
			for(int i = 0; i< size; ++i){
				if(curNum > B || curNum < A || used[curNum - A]);
				else{
					used[curNum - A]  = true;
					cnt ++;
				}
				
				int lastD = curNum % 10;
				curNum /= 10;
				curNum = (int) (curNum  + Math.pow(10, size - 1) * lastD);
			}
			
			rst += cnt * (cnt-1)/2;
		}
		
		return rst +"";
	}

	
	private static void solve(String inputPath, String filepath) {
		FileHelper fHelper = new FileHelper(inputPath);
		
		String[] inputStr= new String[fHelper.getTotalSize()];
		
		List<String> rstList = new ArrayList<String>();
		
		fHelper.init(inputStr);
		
		for (String str : inputStr) {
			rstList.add(getPairCount(str));
		}
		
		rstList = format(rstList);
		
		FileHelper.writeFile(filepath, rstList);
		
	}

	



	public static void main(String[] args) {


		String inputPath = "C:\\Users\\xiaohfan\\Desktop\\C-small-attempt0.in";

		String filepath = "C:\\Users\\xiaohfan\\Desktop\\output.txt";
		
		Gcj2012c.solve(inputPath, filepath);

	}



	public static List<String> format(List<String> rstList) {
		
		List<String> outputList = new ArrayList<String>();
		
		for(int i = 0; i < rstList.size();++i	){
			outputList.add("Case #"+ (i+1) +": "+rstList.get(i));
		}
		
		return outputList;
	}
}
