import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

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