package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.*;
class xyz
{
	public static void main(String args[])
	{
	Scanner sc=new Scanner(System.in);
	int p=sc.nextInt();
	int t=1;
		while(p!=0)
		{
			int z=sc.nextInt();
			int b=sc.nextInt();
				int cnt=0;

		for(int i=z;i<=b;i++)
		{
			int a[]=new int[5000];
			String s=""+i;
			int cnt1=0,d=0;
			int n=Integer.parseInt(s);
			char c[]=s.toCharArray();
			for(int j=1;j<(c.length);j++)
			{
				char temp;
				temp=c[0];

				for(int k=0;k<(c.length-1);k++)
				{


					c[k]=c[k+1];


				}
				c[c.length-1]=temp;
				String s1=new String(c);
				int w=Integer.parseInt(s1);

				if((w>n)&&(w>=z)&&(w<=b))
				{
					a[d]=w;
					d++;

					cnt1++;


				}
			}
				int e=0,cnt2=0;
				while(a[e]!=0)
				{
					cnt2++;
					e++;
				}
				int len=cnt2;
				for(int l=0;l<len;l++)
				{
					for(int m=l+1;m<len;m++)
					{
						if(a[l]==a[m])
						{
							for(int o=m;o<len-1;o++)
							{
								a[o]=a[o+1];
							}
							len--;

						}
					}
				}

				if(len!=cnt1)
				{
					cnt1=len;
				}
				cnt+=cnt1;

		}


		System.out.println("Case #"+t+": "+cnt);


	t++;
p--;		
		}
	
	}
}