import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package com.vp.impl;

import java.util.ResourceBundle;

import com.vp.iface.Problem;

public class SpeakGooglerese implements Problem {

	@Override
	public String solve(String[] dataset) {
		
		ResourceBundle rb = ResourceBundle.getBundle("Mapping");
		String strReturnValue = "";
		//System.out.println("Translated Text: " + strReturnValue);
		
		
		String strGooglereseSentence = dataset[0];
		
		String[] strGooglereseWords = strGooglereseSentence.split(" ");
		
		for(int i=0; i<strGooglereseWords.length; i++)
		{
			if(i >0 )
			{
				strReturnValue += " ";
			}
			char strChars[] = strGooglereseWords[i].toCharArray();
			
			for(int j=0;j<strChars.length;j++)
			{
				try
				{
				   strReturnValue += rb.getString(strChars[j]+"");
				}
				catch(Exception ex)
				{
					strReturnValue += "!";
				}
			}
		}
		
		System.out.println("Translated Text: " + strReturnValue);
		return strReturnValue.trim();
	}

}
