using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.Numerics;
using static System.Math;
using P = System.Numerics.Complex;
using Number = System.Int64;
namespace Program {
    public class Solver {
        Random rnd = new Random(0);
        public void Solve() {
            var n = ri;
            var q = ri;
            var p = Enumerate(n, x => ri - 1);
            var s = new DisjointSet(n);
            var sum = new long[n];
            for (int i = 0; i < n; i++)
                s.Unite(i, p[i]);
            var period = Enumerate(45, x => new List<int>());
            for (int i = 0; i < n; i++)
            {
                period[s.Size(i)].Add(i);
                sum[s.Find(i)] += i + 1;
            }
            var fenwick = Enumerate(45, x => new FenwickTree(n));
            for (int i = 0; i < n; i++)
                fenwick[s.Size(i)].Add(i + 1, sum[s.Find(i)]);
            for (int i = 0; i < q; i++)
            {
                var l = ri - 1;
                var r = ri;
                exec(l, r, period, fenwick);
            }
        }
        void exec(int l, int r, List<int>[] period, FenwickTree[] fenwick) {
            var T = 1L;
            for (int i = 0; i < 44; i++)
            {
                var p = period[i].BinarySearch(l);
                if (p < 0) p = ~p;
                if (p < period[i].Count && period[i][p] < r)
                    T = lcm(T, i);
            }
            Debug.WriteLine(T);
            var ans = 0L;
            const long M = (long)1e9 + 7;
            for (int i = 0; i < 44; i++)
            {
                var sum = fenwick[i][l + 1, r] % M;
                if (sum == 0) continue;
                sum = (sum * ((T / i) % M)) % M;
                ans = (ans + sum) % M;
            }
            Console.WriteLine(ans);
        }
        long gcd(long x, long y) {
            if (x == 0) return y;
            if (y == 0) return x;
            return gcd(y % x, x);
        }
        long lcm(long x, long y) {
            return (x / gcd(x, y)) * y;
        }

        const long INF = 1L << 60;
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0)
                {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion

class DisjointSet {
    int[] par;
    public DisjointSet(int n) {
        par = new int[n];
        for (int i = 0; i < n; i++)
            par[i] = -1;
    }
    public int Find(int i) {
        if (par[i] < 0) return i;
        else return par[i] = Find(par[i]);
    }
    public void Unite(int i, int j) {
        i = Find(i);
        j = Find(j);
        if (i == j) return;
        par[i] += par[j];
        par[j] = i;
    }
    public int Size(int i) {
        return -par[Find(i)];
    }
}
#region FenwickTree
public class FenwickTree {
    int n;
    Number[] bit;
    int max = 1;
    public FenwickTree(int size) {
        n = size; bit = new Number[n + 1];
        while ((max << 1) <= n) max <<= 1;
    }
    /// <summary>sum[a,b]</summary>
    public Number this[int i, int j] { get { return this[j] - this[i - 1]; } }
    /// <summary>sum[0,i]</summary>
    public Number this[int i] { get { Number s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
    public int LowerBound(Number w) {
        if (w <= 0) return 0;
        int x = 0;
        for (int k = max; k > 0; k >>= 1)
            if (x + k <= n && bit[x + k] < w)
            {
                w -= bit[x + k];
                x += k;
            }
        return x + 1;
    }
    /// <summary>add v to bit[i]</summary>
    public void Add(int i, Number v) {
        Debug.Assert(i >= 1);
        for (; i <= n; i += i & -i) bit[i] += v;
    }
    public Number[] Items {
        get {
            var ret = new Number[n + 1];
            for (int i = 0; i < ret.Length; i++)
                ret[i] = this[i, i];
            return ret;
        }
    }
}
#endregion




Measured memory_bytes: 62060