#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(),a.end()
const int LIM=2e5+7;
ll A[LIM], pos[LIM], B[LIM], mi[LIM], mil[LIM];
ll solve(int l, int r, ll u) {
for(int i=l; i<r; ++i) if(A[i]>u) return -1;
int pocz=l;
ll ans=0;
while(l<r) {
ll prawo=min(pos[mi[l]], pos[r]);
if(mil[l]<pocz || pos[l]-pos[mil[l]]>=u) {
ans+=B[l]*min(prawo-pos[l], u);
} else if(prawo-pos[mil[l]]>u) {
ans+=B[l]*min(pos[l]-pos[mil[l]], prawo-pos[mil[l]]-u);
}
++l;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, n) {
cin >> A[i];
pos[i+1]=pos[i]+A[i];
}
rep(i, n) cin >> B[i];
A[n]=-1;
stack<pair<ll,ll>>S;
S.push({-1, n});
for(int i=n-1; i>=0; --i) {
while(S.top().st>B[i]) S.pop();
mi[i]=S.top().nd;
S.push({B[i], i});
}
while(!S.empty()) S.pop();
S.push({-1, -1});
rep(i, n) {
while(S.top().st>=B[i]) S.pop();
mil[i]=S.top().nd;
S.push({B[i], i});
}
while(m--) {
ll l, r, u;
cin >> l >> r >> u; --l; --r;
cout << solve(l, r, u) << '\n';
}
}
