/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package codejam;

/**
 *
 * @author Suarabh Agarwal
 */
import java.io.*;
import java.util.Scanner;

public class Main3
{
 public static void main(String args[]) throws FileNotFoundException
  {
  Scanner scan1 = new Scanner(new FileReader("src//codejam///input"));
    //    Scanner  scan1 = new Scanner(new FileReader("input"));
  //Scanner  scan2 = new Scanner(new FileReader("output"));
  //Scanner  scan3 = new Scanner(new FileReader("test.in"));
  PrintWriter out = new PrintWriter("output1.txt");
  String T = scan1.nextLine();
  int test_case = Integer.parseInt(T);
  int count = test_case;
  //int answer = 0;
  while(count>0)
  {
      int A = scan1.nextInt();
      int B = scan1.nextInt();
     
      //System.out.print(a[0]);
      //System.out.print(a[1]);
      //System.out.println(a[2]);
      int answer = 0;
      int count1 = B-A;
      int num = A;
      
      while(count1>=0)
      {
        // System.out.println(num);
      int temp[] = {0,0,0,0,0,0,0};
      temp[0]=  (int) (num / (Math.pow(10, 6)));
      int store = (int) (num - (temp[0] * Math.pow(10, 6)));
      temp[1]=  (int) ( store / Math.pow(10, 5));
      store =   (int) (store - (temp[1] * Math.pow(10, 5)));
      temp[2]=  (int) ( store / Math.pow(10, 4));
      store =   (int) (store - (temp[2] * Math.pow(10, 4)));
      temp[3]=  (int) (store / Math.pow(10, 3));
      store =   (int) (store - (temp[3] * Math.pow(10, 3)));
      temp[4]=  (int) (store / Math.pow(10, 2));
      store =   (int) (store - (temp[4] * Math.pow(10, 2)));
      temp[5]=  (int) (store / 10);
      store =   (int) (store - (temp[5] * 10));
      temp[6]=  (store);
      // System.out.println(temp[5]);
       //  System.out.println(num);

          int size = 0;
           // System.out.print(temp[0]);
           // System.out.print(temp[1]);
           // System.out.println(temp[2]);
          if(temp[0]!=0)size=7;
          else if(temp[1] != 0)
          size = 6;
          else if(temp[2] != 0)
          size = 5;
          else if(temp[3] != 0)
          size = 4;
          else if(temp[4] != 0)
          size = 3;
          else if(temp[5] != 0)
          size = 2;
          else if(temp[6] != 0)
          size = 1;
          int reduce= (7-size);
     //   System.out.println(temp[6]);
        for(int t=0;t<size;t++)
        {
            temp[t]=temp[reduce+t];
        }
           
 //       System.out.print(temp[0]);
  //      System.out.print(temp[1]);
   //      System.out.println(temp[2]);
        int change[] = new int[size];
        int temp1[] = new int[size];
        //int temp2[] = new int[size];
        for(int j=0; j<(size-1); j++)
        {
           temp1[0] = temp[size-1];
            for(int i=1; i<size; i++)
           {
                 temp1[i] = temp[i-1];
           }
         //  System.out.print(temp1[0]);
         //  System.out.println(temp1[1]);

           temp=temp1.clone();
           int num1=0;
           for(int k=0; k<size;k++)
           num1+=temp1[k]*Math.pow(10,(size-1-k));
           change[j]=num1;
         //  System.out.println(num1);
           if(num1>num && num1<=B)
            {
             for(int h=0;h<j;h++)
             {
                 if(num1==change[h])
                 {
                    answer--;
                    break;
                 }
             }
             answer++;
            }
        }
          num++;
          count1--;
      }
      out.println("Case #"+(test_case-count+1)+": "+ answer);
      count--;
  }
  out.close();
  }
  }