using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var q = NN;
        var qlist = new List<(int id, int l, int r)>(q);
        for (var i = 0; i < q; ++i)
        {
            var c = NList;
            qlist.Add((i, c[0], c[1]));
        }
        qlist.Sort((l, r) => r.l.CompareTo(l.l));
        var max = 1_000_000;
        var ft = new FenwickTree(max + 1);
        for (var i = 1; i <= max; ++i) ft.Add(i, 1);
        var ans = new long[q];
        var qi = 0;
        for (var i = max; i > 0; --i)
        {
            for (var j = i * 2; j <= max; j += i) if (ft.Get(j) == 1) ft.Add(j, -1);
            while (qi < q && qlist[qi].l == i)
            {
                ans[qlist[qi].id] = ft.Sum(qlist[qi].r) - ft.Sum(qlist[qi].l - 1);
                ++qi;
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, int value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            if (index < 0) return 0;
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        public long Get(int index)
        {
            if (index == 0) return Sum(0);
            return Sum(index) - Sum(index - 1);
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}