import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class Recycle 
{
	public static void main(String[] args) throws IOException 
	{
		Scanner s = new Scanner(new File("C-small-attempt0.in"));
		FileWriter strm = new FileWriter("out1.txt");
		BufferedWriter out = new BufferedWriter(strm);
		int cases = s.nextInt();
		s.nextLine();
		int count = 1;
		while(count - 1 < cases)
		{
			int A = s.nextInt();
			int B = s.nextInt();
			out.write("Case #" + count + ": " + calc(A,B) + "\n");
			count++;
		}
		out.close();
	}
	private static int calc(int a, int b)
	{
		int count = 0;
		for(int i = a; i<=b;i++)
		{
			count+=numPairs(i,a,b);
		}
		return count;
	}
	private static int numPairs(int i,int a, int b)
	{
		char[] arr = Integer.toString(i).toCharArray();
		char[] newArr = new char[arr.length];
		ArrayList<Integer> list = new ArrayList<Integer>();
		int count = 0;
		for(int j= 1;j<arr.length;j++)
		{
			for(int k = 0;k<arr.length;k++)
			{
				newArr[k] = arr[(k+j)%arr.length];
			}
			int res = Integer.parseInt(String.copyValueOf(newArr));
			if(a <= i && i < res && res <=b && !list.contains(res))
			{
				count++;
				list.add(res);
			}
			for(int k = 0;k<arr.length;k++)
			{
				newArr[k] = arr[(arr.length-j+k)%arr.length];
			}
			res = Integer.parseInt(String.copyValueOf(newArr));
			if(a <= i && i < res && res <=b && !list.contains(res))
			{
				count++;
				list.add(res);
			}
		}

		return count;
	}
}
