#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>
#include <queue>
#include <map>
#include <list>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d",&n);
#define gets(s) string s;cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)
#define For(i,j,k) for(int (i)=(j);(i)<(k);(i)++)
#define repd(i,j) for(int (i)=(j);(i)>=0;(i)--)
#define Ford(i,j,k) for(int (i)=(j);i>=(k);i--)
#define vfor(c,v) for(auto (c): v)
#define mem(a,b) memset(a,b,sizeof(a));
#define dump(x)  std::cout << #x << " = " << (x) << std::endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double> ;
using vvd = std::vector<vd> ;
using qi = std::queue<int> ;
using vpii = std::vector<std::pair<int, int> >;
using vpll = std::vector<pll>;
using namespace std;

const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
//_____________________________________Templates_________________________________________//

template<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}
template<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}
template<class T> inline void swap(T &a,T &b){T c = a;a = b;b = c;}
template<class T> inline void pri(T a){cout << a << endl;}
//mainly use for dynamic prog
template<class T1, class T2>
void update(T1 &a, T2 b){
  a += b;
  if(a > Mod) a %= Mod;
}

inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

bool pairsort(pll pl, pll pr){
  if(pl.first == pr.first)return pl.second > pr.second;
  return pl.first < pr.first;
}

int cntbit(ll a,int n,int j){int res = 0;For(i,j,n){if(a>>i & 1){res++;}}return res;}
ll makebit(ll a,int n,int j){ll res = 0;For(i,j,n){if(a &(1 << i))res |= 1ll << (i - j);}return res;} 
int GCD(int a, int b){if(b > a)return GCD(b,a);if(a%b == 0)return b;else return GCD(b, a%b);}
int LCM(int a, int b){return a*b/GCD(a,b);}
int compress(vi& x1, vi& x2,int w){
  int n = x1.size();
  vi vx;
  rep(i,n){
  	vx.pb(x1[i]);
    vx.pb(x2[i]);
  }
  vx.pb(0);vx.pb(w);
  sort(All(vx));
  vx.erase(unique(All(vx)), vx.end());
  rep(i,n){
    int idx1 = lower_bound(All(vx), x1[i]) - vx.begin();
    int idx2 = lower_bound(All(vx), x2[i]) - vx.begin();
    x1[i] = idx1;
    x2[i] = idx2;
  }
  /*OUT(-1);
  for(auto c : vx)OUT(c);
  OUT(-1);*/
  return vx.size()-1;
}
//_______________________data structure__________________
struct SegTree  {
  using T = pll;
  vector<T> dat;
  T UNIT;
  int n;
  int s;
  SegTree(int n, T a) : n (n),UNIT(a){
    s = 1;
    while(s < n){
      s *= 2;
    }
    dat = vector<T>(s*2 - 1,pll(1ll,0ll));
  }
  void update(int idx, T x){
    idx += s - 1;
    dat[idx] = change(dat[idx], x);
    while(idx > 0){
      idx = (idx - 1) / 2;
      dat[idx] = judge(dat[2*idx+1], dat[2*idx+2]);
    }
  }
  T query(int a, int b, int cen, int l, int r){
    if(r <= a || b <= l)return UNIT;
    if(a <= l && r <= b)return dat[cen];
    return judge(query(a,b,cen*2+1,l,(l+r)/2), query(a,b,cen*2+2,(r+l)/2,r));
  }
  T find(int a, int b){
    return query(a,b,0,0,s);
  }

  T judge(const T &a, const T &b){
    ll l = a.first/__gcd(a.first, b.first)*b.first;
    pll p = make_pair(l, (l/a.first%Mod*a.second%Mod + l/b.first%Mod*b.second%Mod) % Mod);
    return p;
  }
  T change(const T &a, const T &b){return b;}
};

void show(pii p){
  cout << "p = " << p.first << ", " << p.second << endl;
}

//_____________________　following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;

int n,m,k;
vvi dp;
string S;
vll cost(1 << 16);
int a,b,c;
int h,w;
vi v;
vll u;
vpii vp;
bool check(){
  return true;
}
ll rec(){
  ll res = 0;
  return res;
}
vll p, sum;

int main () {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int q;
  IN(n,q);
  p = sum = vll(n+1);
  rep(i,n){
    IN(p[i+1]);
  }
  vll ped(n+1);
  rep(i,n){
    int x = i+1;
    int ti = 0;
    sum[i+1] = i+1;
    rep(j,40){
      x = p[x];
      ti++;
      if(x != (i+1)){
        (sum[i+1] += x) %= Mod;
      }
      else break;
    }
    ped[i+1] = ti;
  }
  SegTree st(n,pll(1ll,0ll));
  rep(i,n){
    st.update(i,pll(ped[i+1], sum[i+1]));
  }
  rep(i,q){
    IN(a,b);a--;
    pll ans = st.find(a,b);
    cout << ans.second << endl;
  }

  //OUT("start");
  /*/rep(i,n){
    pii p = st.dat[i+st.s-1];
    cout << "dat[" ;
    cout<< i;
    cout  << "] = (" << p.first << ", " << p.second << ") " << endl;
  }*/
  /*pii ip = st.judge(st.dat[2], st.dat[1]);
  show(ip);
  OUT("end");*/
  //cout << ans << endl;
  //for(auto c : ans){cout << c << endl;}
  //cout << fixed << setprecision(15) << ans << endl;
  return 0;
}



Measured memory_bytes: 9772