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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

/**
 * @author Addy
 */
public final class CodeJamIO
{

    private static final String input = ".in";
    private static final String output = ".out";
    //input
    private final Scanner sc;
    private final PrintStream ps;
    private int index;
    private final int size;
    //data
    private int min;
    private int max;

    public CodeJamIO(String file)
    {
        Scanner tussensc = null;
        PrintStream tussenps = null;
        try
        {
            tussensc = new Scanner(new File(file + input));
            tussenps = new PrintStream(new File(file + output));
        }
        catch(FileNotFoundException ex)
        {
            ex.printStackTrace(System.err);
            System.exit(1);
        }
        sc = tussensc;
        ps = tussenps;
        index = 0;
        size = sc.nextInt();
        //init
        init();
        next();
    }

    public void print(String solution)
    {
        ps.println("Case #" + index + ": " + solution);
    }

    public boolean hasMore()
    {
        return index < size;
    }

    public void close()
    {
        sc.close();
        ps.close();
    }

    public void init()
    {
    }

    public void next()
    {
        min = sc.nextInt();
        max = sc.nextInt();
        index++;
    }

    public void solve()
    {
        //calc
        int opl = 0;

        int tien2 = 10;
        while(tien2 <= min)
            tien2 *= 10;
                    HashSet<Integer> set = new HashSet<>();
        for(int n = min; n < max; n++)
        {
            set.clear();
            int tien = 10;
            while(tien < n)
            {
                final int deel = n / tien;
                final int rest = n % tien;
                int m = (rest * tien2 / tien) + deel;
                if(n < m && m <= max)
                {
                    if(!set.contains(m))
                    {
                        set.add(m);
                        opl++;
                    }
                }
                tien *= 10;
            }
        }
        //print
        print(Integer.toString(opl));
    }

    public static void main(String[] args)
    {
        CodeJamIO cd = new CodeJamIO("C-small-attempt0");
        cd.solve();
        while(cd.hasMore())
        {
            cd.next();
            cd.solve();
        }
        cd.close();
    }

}
