import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class C {

	static int pow(int b)
	{
		return (int)Math.pow(10,b);
	}
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner sin=new Scanner(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\C-large.in"));
		PrintStream ps=new PrintStream(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\COut.out"));
		
		int cases=sin.nextInt();
		for(int test=1;test<=cases;test++)
		{
			int start=sin.nextInt();
			int stop=sin.nextInt();
			int count=0;
			int max=0;
			
			while(start/pow(max) >0)
				max++;
			max--;
			String s;
			for(int i=start;i<=stop;i++)
			{
				s="";
				int temp=max;
				while(temp>0)
				{
					int t=((i%pow(temp))*(pow(max-temp+1)))+i/pow(temp);
					temp--;
					if(t>i && t<=stop)
					{
						if(s.indexOf(t+"|")!=-1)
							continue;
						s+=t+"|";
						count++;
					}
				}
			}
			
			ps.println("Case #"+test+": "+count);
		}
		
		
	}
}
