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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;


public class Small_C {

	/**
	 * @param args
	 */
		
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		File inf;
		File outf;

		try{
			inf= new File("C-small-attempt0.in");
			FileReader inputFil = new FileReader(inf);
			BufferedReader in = new BufferedReader(inputFil);
//			System.out.println("hiiiiiiii");
			
			FileWriter fstream = new FileWriter("output3.txt");
			  BufferedWriter out = new BufferedWriter(fstream);
			  
			  
			  
			
			int T= Integer.parseInt(in.readLine());
	
			
			
			
			for (int i=0;i<T;i++)
			{
				String op1="Case #" + (i + 1) + ": ";
				out.write(op1);

				String inputs=in.readLine();
				System.out.println(inputs);
				String[] dat= inputs.split(" ");
			
				int A = Integer.parseInt(dat[0]);
				int B = Integer.parseInt(dat[1]);

				int ans = 0;
				
				int n,n1,n2,n3;
				if(A<10 && A>=1)
				{
					ans=0;
				}
				
				else if(A<100 && A>=10)
				{
					for(int j=A;j<=B;j++)
					{
						n=j;
						
						n1=(n%10)*10+(n/10);
						
						for(int k=j;k<=B;k++)
						{
							if(k!=j && k==n1)
								ans++;
						}
						
					}
					
				}
				else if(A<1000 && A>=100)
				{
					for(int j=A;j<=B;j++)
					{
						n=j;
						
						n1=(n%10)*100+(n/10);
						n2=(n%100)*10+(n/100);
						
						for(int k=j;k<=B;k++)
						{
							if(k!=j && k==n1)
								ans++;
							if(k!=j && k==n2)
								ans++;
						}
						
					}

					
				}
				else if(A==1000)
				{
					ans=0;
				}
						
				
				out.write(ans+"");
				out.newLine();
				
			}
			
			out.close();			
		}
		catch (Exception e) {
			// TODO: handle exception
			e.printStackTrace();
		}
		
	}


	}


