package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

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


import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;

/**
 *
 * @author linlin
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        File file=new File("C-large.in");
        FileOutputStream o=new FileOutputStream("a.txt");
        Scanner s=new Scanner(file);
        int t=Integer.valueOf(s.nextLine());
        for(int i=1;i<=t;i++){
            String line=s.nextLine();
            String[] num=line.split(" ");
            int a=Integer.valueOf(num[0]);
            int b=Integer.valueOf(num[1]);
            int d=1;
            int tens=10;
            for(;tens<=a;tens=tens*10)
                    d++;
            tens=tens/10;

            int[] total=new int[d];
            for(int q=a;q<=b;q++){
                int correct=0;
                int q1=q;
                boolean shift=true;
                for(int k=0;k<d;k++){

                    int r1=q1%10;
                    q1=q1/10+r1*tens;
                    if((q1==q)&&shift)
                        break;
                    else if((q1>=a)&&(q1<=b)){
                        correct++;
                        //System.out.println(q1);
                    }
                    shift=false;
                    
                }
                if(correct>1){
                    total[correct-1]=total[correct-1]+1;
                   
                }

            }
            int result=0;
            for(int n=1;n<d;n++){
                result=result+(total[n]*n/2);
                
            }
            String out="Case #"+i+": "+result+"\r\n";
            o.write(out.getBytes());



        }
    }

}
