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

}



import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

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

/**
 *
 * @author joshuahm
 */
public class codejamC {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("C-large.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("C-large.out");
        PrintWriter out = new PrintWriter(outFile);
        //Scanner in = new Scanner(System.in);
        
            ArrayList<String> temp2 = new ArrayList<String>();
            String temp;
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                {
                    temp = "" + i + j; 
                    temp2.add(temp);
                }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                    {
                        temp = "" + i + j + k ; 
                        temp2.add(temp);
                    }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                        {
                            temp = "" + i + j + k + l; 
                            temp2.add(temp);
                        }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                            {
                                temp = "" + i + j + k + l + m; 
                                temp2.add(temp);
                            }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                                for(int n=0;n<10;n++)
                                {
                                    temp = "" + i + j + k + l + m + n; 
                                    temp2.add(temp);
                                }
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                                for(int n=0;n<10;n++)
                                    for(int p=0;p<10;p++)
                                {
                                    temp = "" + '1' + j + k + l + m + n + p; 
                                    temp2.add(temp);
                                }
           
            String[] perms = new String[temp2.size()];
            temp2.toArray(perms);     
            int total=0;
            int x;
        
        int T= in.nextInt();
        for(int t=0;t<T;t++)
        {
            total=0;
            int A= in.nextInt();
            int B= in.nextInt();    
            HashSet<Integer> distinct = new HashSet<Integer>();
            for(int i=0;i<perms.length;i++)
            {
                if(Integer.parseInt(perms[i])>B)
                    break;
                distinct.clear();
                temp = perms[i];
                if(Integer.parseInt(perms[i])>=A && Integer.parseInt(perms[i])<=B)
                {
                    distinct.add(Integer.parseInt(perms[i]));
                    for(int j=0;j<perms[i].length()-1;j++)
                    {
                        temp=temp.substring(1)+ temp.charAt(0);
                        x = Integer.parseInt(temp);
                        if(x<=B && x>=A && temp.charAt(0) != '0')
                            distinct.add(x);
                    }   
                    total+= distinct.size()-1;
                    //if(distinct.size()>1)
                       // System.out.println(perms[i] + "   " + (distinct.size()-1));
                } 
            }            
            out.println("Case #"+ (t+1) +": " + total/2);
        }
        in.close();
        out.close();
    }
}
