package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Date;
import java.util.HashMap;
import java.util.Scanner;

public class QC_Large2012 {

	public static void main(String[] args) throws Exception {
		new QC_Large2012();
	}
	
	static final String filename = "C-large";
	int testcases;
	int[] tenPowers;
	
	public QC_Large2012() throws Exception {
		FileReader ifile = new FileReader(filename+".in");
		Scanner scanner = new Scanner(ifile);
		testcases = Integer.parseInt(scanner.nextLine());
		FileWriter ofile = new FileWriter(filename+".out");
		for (int i = 1; i <= testcases; i++) {
			ofile.write("Case #"+i+": "+solve(scanner.nextInt(), scanner.nextInt())+(i != testcases ? "\n" : ""));
		}
		ofile.close();
		System.out.println("Finished");
		
		/*
		 * Benchmarking code */
		/*
		long n = new Date().getTime();
		for (int i = 0; i < 20000000; i++)
			intStringLen(i);
		System.out.println(new Date().getTime() - n);
		n = new Date().getTime();
		for (int i = 0; i < 20000000; i++)
			intLen(i);
		System.out.println(new Date().getTime() - n);
		//solve(1, 4);
		int l = 3;
		tenPowers = new int[l+1];
		initTenPowers(tenPowers);
		System.out.println(rotR(123,0,l));*/
	}

	private int solve(int A, int B) throws Exception {
		int l = intLen(A); //len A = len B (definition)
		tenPowers = new int[l+1];
		initTenPowers(tenPowers);
		int sum = 0;
		for (int n = A; n <= B-1; n++) {
			sum += recycledPairs(n, B, l);
		}
		return sum;
	}
	
	private void initTenPowers(int[] tenPowers) {
		tenPowers[0] = 1;
		for (int i = 1; i < tenPowers.length; i++)
			tenPowers[i] = tenPowers[i-1] * 10;
	}

	private int recycledPairs(int n, int B, int l) {
		int sum = 0;
		int m;
		for (int i = 0; i < l; i++) {
			m = rotR(n, i, l);
			if (m > n && m <= B)
				sum++;
		}
		return sum;
	}
	
	private int rotR(int n, int x, int l) {
		int back = n % tenPowers[x];
		int front = n / tenPowers[x];
		return front + back * tenPowers[l-x];
	}
	
	private int intLen(int n) {
		int l = 0;
		while (n > 0) {
			n /= 10;
			l++;
		}
		return l;
	}
}
