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());
	}

}

import java.io.*;
import java.util.*;

public class C {
    BufferedReader ins;
    PrintStream outs;

    static String INPUT = "C-large.in";
    static String OUTPUT;

    static {
        OUTPUT = "C-large.out";
    }

    Map<String, Set<String>> map = new HashMap<String, Set<String>>();
    
    public C(BufferedReader ins, PrintStream outs) {
        this.ins = ins;
        this.outs = outs;
    }

    public void preprocess() {
        for(int j = 1; j<=2000000; j++) {
            String k = new Integer(j).toString();
            Set<String> set = new HashSet<String>();
            int sz = k.length();
            for(int i = 1; i<sz; i++) {
                set.add(k.substring(i) + k.substring(0,i));
            }
            map.put(k, set);
        }
    }
    
    public int permuteK(int k, int b) {
        int sz = new Integer(b).toString().length();
        int ret = 0;

        Set<String> set = new HashSet<String>();
        for(int i = 0; i<sz; i++) {
            String x = new Integer(k).toString();
            String sb = x.substring(i) + x.substring(0,i);
            
            assert(sb.length() == sz);
            
            int newk = Integer.parseInt(sb);
            if(newk > k && newk <=b) {
                if(!set.contains(x+"-"+sb)) {
                    set.add(x+"-"+sb);
                }
                ret++;
            }
        }
        return set.size();
    }
   
    public int permuteL(int k, int b) {
        String m = new Integer(k).toString();
        int count = 0;
        for(String r : map.get(m)) {
            int newk = Integer.parseInt(r);
            if(newk>k && newk<=b) count++;
        }
        return count;
    }
    public int go(int a, int b) {
        int count = 0;
        for(int k = a; k < b; k++) {
            count += permuteK(k, b);
        }
        return count;
    }

    public void process() throws Exception {
//        preprocess();
 //       System.out.println("Hi");
       //Read input
       int t = Integer.parseInt(ins.readLine());

       for(int T=1; T<=t;T++) {
            String x = ins.readLine().trim().replaceAll(" +", " ");
            String[] tokens = x.split(" ");
            int a = Integer.parseInt(tokens[0]);
            int b = Integer.parseInt(tokens[1]);
            
            outs.println("Case #" + T + ": " + go(a,b));
        }
    }

    public static void main(String args[]) throws Exception {
        //Input
        InputStreamReader fis = new FileReader(INPUT);
        BufferedReader bis = new BufferedReader(fis);

        //Output
        PrintStream ps = OUTPUT!=null ? new PrintStream(OUTPUT) : System.out;
        
        C c = new C(bis, ps);

        c.process();
        return;
    }
}
