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

}

package recycledNumbers;

import java.util.*;

public class RecycledNumbers 
{
	public int countRecylcedNumbers(int x, int y )
	{
		
		int count =0;
		int m=x+1;
		ArrayList<ArrayList<String>>  arrayList= new ArrayList<ArrayList<String>>();
		ArrayList<String> list = new ArrayList<String>();
		for(int i=0;i<y;i++)
		{
			
			arrayList.add(null);
		}
		boolean flag = true;;
		for(int i=m;i<=y;i++)
		{
			int[] array = recycledNumber(i);
			list = new ArrayList<String>();
			for(int j=0;j<array.length;j++)
			{
				
				if(array[j]<=y && array[j]!=i && array[j]!=0 && array[j]>=x)
				{
					flag = true;
					if(i==m)
					{
						System.out.println(i + "    " + array[j]);
						count++;
						list.add(new Integer(array[j]).toString());
					}
					else
					{
						ArrayList<String> searchList= arrayList.get(array[j]);
						if(searchList!= null)
						{
							for(int k=0;k<searchList.size();k++)
							{
								if(Integer.parseInt(searchList.get(k))==i)
								{
									flag = false;
								}
							}
						}
						if(flag != false)
						{
							System.out.println(i + "    " + array[j]);
							count++;
							list.add(new Integer(array[j]).toString());
						}
						
					}
				}
			}
			arrayList.add(i, list);
		}
		System.out.println(count);
		return count;
	}
	public int digitCount(int x)
	{
		int count=0;
		while(x!=0)
		{
			x/=10;
			count++;
		}
		return count;
		
	}
	
	public int[] recycledNumber(int x)
	{
		int y, count = 0;
		count = digitCount(x);
		y=count-1;
		int place;
		int lastInt;
		int[] array = new int[y];
		int i=0;
		while(y!=0)
		{
			place = (int) Math.pow(10, count-1);
			lastInt = x%10;
			x/=10;
			x=lastInt*place + x;
			if(digitCount(x)==count)
			{
				array[i++]=x;
			}
			y--;
		}
		return array;
	}
}
