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();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, q) = (c[0], c[1]);
        var a = NList;
        var query = NArr(q);
        var map = new List<int>[100001];
        for (var i = 1; i < map.Length; ++i) map[i] = new List<int>();
        for (var i = 0; i < n; ++i)
        {
            foreach (var p in PList(a[i])) map[p].Add(i);
        }
        var ans = new int[q];
        for (var i = 0; i < q; ++i)
        {
            var lpos = LowerBound(0, query[i][0] - 1, map[query[i][2]]);
            var rpos = LowerBound(0, query[i][1], map[query[i][2]]);
            ans[i] = rpos - lpos;
        }
        WriteLine(string.Join("\n", ans));
    }
    static List<int> PList(int a)
    {
        var ans = new List<int>();
        for (var i = 1; i * i <= a; ++i)
        {
            if (a % i == 0)
            {
                ans.Add(i);
                if (i * i < a) ans.Add(a / i);
            }
        }
        return ans;
    }
    static int LowerBound(int left, int min, IList<int> list)
    {
        if (left >= list.Count) return list.Count;
        if (list[left] >= min) return left;
        var ng = left;
        var ok = list.Count;
        while (ok - ng > 1)
        {
            var center = (ng + ok) / 2;
            if (list[center] < min) ng = center;
            else ok = center;
        }
        return ok;
    }
}