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

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.*;
import java.util.*;
public class rfin {
public static void main(String args[]){
	try{
		FileInputStream fstream = new FileInputStream("C-small-attempt2.in");
		  // Get the object of DataInputStream
		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  FileWriter fstreamo = new FileWriter("out.txt");
		  BufferedWriter out = new BufferedWriter(fstreamo);
		  
		  
		//  System.out.println(g);
		 int t=Integer.parseInt(br.readLine());
		//  System.out.println(t);
		  int u,v,d,dr,rs,p,qs,q,qd,a,b,c,i,j,k,r,n,count;
		  String str;
		  for(i=0;i<t;i++){
			  count=0;
			  d=0;
			  str = br.readLine();
			  System.out.println(str);
			  StringTokenizer st=new StringTokenizer(str);
			  a=Integer.parseInt(st.nextToken());
			  //System.out.println(a);
		   	  b=Integer.parseInt(st.nextToken());
		   	//System.out.println(b);
		   	  n=b-a+1;
		   	  //System.out.println(n);
		   	  c=a;
		   	int[][] m = new int[1001][1001];
		   	for(u=0;u<1001;u++){
		   		for(v=0;v<1001;v++){
		   			if(u==v)m[u][v]=1;
		   			else m[u][v]=0;
		   		}
		   	}
		   	  while(c>0){
		   		  c=c/10;
		   		  d++;
		   	  }
		   	System.out.println(d);
		   	  for(j=a;j<=b;j++){
				   	//System.out.println(j);
		   		  
		   		  for(k=1;k<=d-1;k++){
		   		    	qd=0;dr=0;
		   			  p=(int)Math.pow(10,k);
		  		   //	System.out.println(p);	  
		   		    	q=j/p;
		   			   	//System.out.println(q);
		   		    	qs=q;
		   		    	while(qs>0){
		   		    		qs=qs/10;
		   		    		qd++;
		   		    	}
		   		    	r=q+(j%p)*((int)Math.pow(10,qd));
		   			 
		   			  
		   			   	System.out.println(j);		   	System.out.println(r);
		   			  System.out.println(m[j][r]);		   	System.out.println(m[r][j]);
		   			  rs=r;
		   			  while(rs>0){dr++;
		   			  rs=rs/10;}
		   			System.out.println(dr);
		  		   	System.out.println("++++++++++");
		   		if(m[j][r]!=1&&m[r][j]!=1&&dr==d&&r<=b&&j<r)
		   			  {count++;
		   			System.out.println(count);
		   			  System.out.println("=========");
		   			  m[j][r]=1;
		   			  m[r][j]=1;}
		   		  }
		   	  }
		  System.out.println(count);
		  out.write("Case #"+(i+1)+": "+count);
		  out.newLine();
		  }
		
	out.close();
	in.close();
	//out1.close();
	}
	
	catch(Exception e){//Catch exception if any
		  System.err.println("Error: " + e.getMessage());
	  }
	
	
}
}
