#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
// priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
// ll mod = 998244353;
 ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 

ll fact[fact_table + 5],rfact[fact_table + 5];
 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}


ll num,sum,a,b,e,h,r,l,q;
ll w, ans;
ll k;
ll d[5005];
ll n[5005], x[5005], m[5005];
// ll x[500005], y[500005], z[500005];
char s[500005], t[500005];

void solve(ll n,ll x,ll m){
    n--;
    x = x % m;
    ll zero = 0;
    vector<ll> myd;
    for(ll i=0;i<k;i++){
        myd.pb(d[i] % m);
        if(d[i] % m == 0)zero++;
    }
    ll sum = 0;
    for(ll i=0;i<k;i++){
        sum += myd[i];
    }
    ll gain = sum / m;
    ll reside = sum % m;
    ll roop = n / k;
    gain *= roop;
    reside *= roop;
    zero *= roop;
    zero %= mod;
    gain += reside / m;
    reside = reside % m ;
    for(ll i=0;i<n%k;i++){
        reside += myd[i];
        if(myd[i] == 0)zero++;
        if(reside >= m){
            gain += reside / m;
            reside %= m;
        }
    }
    zero %= mod;
    ll ans;
    if(x > (x + reside) % m){
        ans = n + (mod - 1) + (mod - zero) + (mod - gain);
        ans %= mod;
    }else{
        ans = n + (mod - zero) + (mod - gain);
        ans %= mod;
    }
    p(ans);
    return;
}

int main(){
    cin >> k >> q;
    for(ll i=0;i<k;i++){
        cin >> d[i];
    }
    for(ll i=0;i<q;i++){
        cin >> n[i] >> x[i] >> m[i];
        solve(n[i], x[i], m[i]);
    }

    return 0;

}


















Measured memory_bytes: 512