import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.*;
import java.util.*;

public class ProbC
{
	public static void main(String[] args) throws FileNotFoundException, IOException
	{
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		int times = Integer.parseInt(br.readLine());
		BufferedWriter wr = new BufferedWriter(new FileWriter("C-small-attempt0soln.in"));
		for (int i = 0; i < times; i++)
		{
			String sentence = br.readLine();
			String[] nums = sentence.split(" ");
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			int recycledPairs = 0;
			ArrayList<Integer> firstIncluded = new ArrayList<Integer>();
			ArrayList<Integer> secondIncluded = new ArrayList<Integer>();

			for (int currNum = a; currNum <= b; currNum++)
			{
				if (!firstIncluded.contains(currNum))
				{
					boolean currNumAdded = false;
					String currNumString = currNum + "";

					int digits = currNumString.length();
					for (int x = 0; x < digits; x++)
					{
						currNumString = currNumString.substring(currNumString.length() - 1) + currNumString.substring(0, currNumString.length() - 1);

						int currNumCheck = Integer.parseInt(currNumString);
						if (currNumCheck >= a && currNumCheck <= b && !(firstIncluded.contains(currNum) && secondIncluded.get(firstIncluded.indexOf(currNum)).equals(currNumCheck)) && !(secondIncluded.contains(currNumCheck) && firstIncluded.get(secondIncluded.indexOf(currNumCheck)).equals(currNum)) && currNumCheck != currNum)
						{
							secondIncluded.add(currNumCheck);
							recycledPairs++;
							//if (!currNumAdded)
							//{
								firstIncluded.add(currNum);
							//	currNumAdded = true;
						//	}
						//	System.out.println("(" + currNum + ", " + currNumString + ")");
						}
						/*else
						{
							if (currNumCheck >= a && currNumCheck <= b && currNumCheck != currNum) //&& !numsAlreadyIncluded.contains(currNumCheck) && currNumCheck != currNum)
								System.out.println("(" + currNum + ", " + currNumCheck + ")");
						}*/
					}
				}
			}
			recycledPairs /= 2;
			wr.write("Case #" + (i+1) + ": " + recycledPairs);
			wr.newLine();
		}
		wr.close();
	}
}