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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;




public class testapp {

	/**
	 * @param args
	 */
	
	public static void main(String[] args) {
		 StringBuilder contents = new StringBuilder();
		 int totalCase=0;
		 int aVar[]=null,bVar[]=null;
		 int loop=-1;
		 
		    
		    try {
		    String aFile="c:\\testapp.txt";
		      BufferedReader input =  new BufferedReader(new FileReader(aFile));
		      try {
		        String line = null; 
		        while (( line = input.readLine()) != null){
		          if(loop==-1)
		          {
		        	  System.out.println(line.trim());
		        	totalCase =Integer.parseInt(line);
		        	aVar =new int[totalCase];
		        	bVar =new int[totalCase];
		        	loop++;
		        	continue;
		          }
		          String[] result = line.split("\\s");
		          aVar[loop]=Integer.parseInt(result[0]);
		          bVar[loop]=Integer.parseInt(result[1]);
		          loop++;
		        }
		      }
		      finally {
		        input.close();
		      }
		    }
		    catch (IOException ex){
		      ex.printStackTrace();
		    }
		
		
		for(int caseid=0;caseid<totalCase;caseid++)
		{
			int a=aVar[caseid];
			int b=bVar[caseid];
			int num=a;
		
		ArrayList<String> matchlist=new ArrayList<String>();
	
		while(num<=b)
		{
			
		checkpairs(num,a,b,matchlist);
		num++;
			
		}
		
		System.out.println("Case #"+(caseid+1)+": "+matchlist.size());
		}

	}
	
	public static int checkpairs(int num,int a, int b,ArrayList<String> matchlist)
	{
		int count=0;
		int rnd=1;
		int m;
		double div;
		int size=String.valueOf(num).trim().length();
		while(rnd<size)
		{
			
			div=num/Math.pow(10, rnd);
			m=(int)(num%Math.pow(10, rnd)*Math.pow(10, size-rnd))+(int)(Math.floor(div));
	
			if(m>=a && m<=b && m!=num )
			{
				if(!(matchlist.contains(num+"-"+m)|| matchlist.contains(m+"-"+num)))
					matchlist.add(num+"-"+m);
			}
			
			rnd++;
		}
	
		return count;
	}

}
