#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x) {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x) {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x) {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2e5+5;
int n,m,a[N],b[N],s[N],tot,ans[N],tick,nxt[N],dfn[N],dt,sz[N],st[N],top,fa[N][25],sum[N][25];
pii f[25][N],g[25][N];
set<int> sc;
struct qry {int s,t,u,id;} q[N];
priority_queue<pii>Q;
vi e[N];

bool cmp(const qry &a,const qry &b) {return a.u<b.u;}
pii operator + (const pii &a,const pii &b) {return pii(a.fi+b.fi,a.se+b.se);}
pii operator * (const pii &a,const int &b) {return pii(a.fi*b,a.se*b);}
pii qmax(int l,int r) {
  int len=r-l+1, h=__lg(len);
  return max(f[h][l],f[h][r-(1<<h)+1]);
}
pii qmin(int l,int r) {
  int len=r-l+1, h=__lg(len);
  return min(g[h][l],g[h][r-(1<<h)+1]);
}

void dfs(int u) {
  dfn[u]=++dt; sz[u]=1;
  rep(h,1,20) fa[u][h]=fa[fa[u][h-1]][h-1], sum[u][h]=sum[u][h-1]+sum[fa[u][h-1]][h-1];
  for(int v:e[u]) fa[v][0]=u, sum[v][0]=b[v]*(s[u-1]-s[v-1]), dfs(v), sz[u]+=sz[v];
}

pii val(int x,int pnxt=0) {
  auto itp=sc.lower_bound(x), itn=sc.upper_bound(x);
  if(*itp!=x) return pii(0,0);
  else if(itp==sc.begin()) {
    int nxt=*itn;
    if(b[x]>b[nxt]) return pii(0,s[nxt-1]-s[x-1])*b[x];
    else return pii(1,0)*b[x];
  } else {
    int pre=*--itp, nxt=*itn; if(pnxt) nxt=pnxt;
    if(b[pre]>b[x]&&b[x]>b[nxt]) return pii(0,s[nxt-1]-s[x-1])*b[x];
    else if(b[pre]>b[x]) return pii(1,0)*b[x];
    else if(b[x]>b[nxt]) return pii(-1,s[nxt-1]-s[pre-1])*b[x];
    else return pii(0,s[x-1]-s[pre-1])*b[x];
  }
}
void insd(int x) {
  auto itp=sc.lower_bound(x), itn=sc.upper_bound(x);
  if(*itp!=x) return;
  else if(itp==sc.begin()) return;
  else {
    int pre=*--itp, nxt=*itn;
    if(b[x]>=b[pre]&&b[x]>b[nxt]) Q.push(pii(-s[nxt-1]+s[pre-1],x));
  }
}

namespace SegT {
  int ls[N<<1],rs[N<<1],tot=1; pii s[N<<1];
  void build(int p,int l,int r) {
    if(l==r) {s[p]=val(l); return;} int mid=l+r>>1;
    build(ls[p]=++tot,l,mid), build(rs[p]=++tot,mid+1,r);
    s[p]=s[ls[p]]+s[rs[p]];
  }
  void mdf(int p,int l,int r,int x) {
    if(l==r) {s[p]=val(l); return;} int mid=l+r>>1;
    if(x<=mid) mdf(ls[p],l,mid,x);
    else mdf(rs[p],mid+1,r,x);
    s[p]=s[ls[p]]+s[rs[p]];
  }
  pii qry(int p,int l,int r,int x,int y) {
    chmin(y,n);
    if(l==x&&r==y) return s[p]; int mid=l+r>>1;
    if(y<=mid) return qry(ls[p],l,mid,x,y);
    else if(x>mid) return qry(rs[p],mid+1,r,x,y);
    else return qry(ls[p],l,mid,x,mid)+qry(rs[p],mid+1,r,mid+1,y);
  }
}

namespace FenT {
  int s[N];
  int lb(int x) {return x&-x;}
  void add(int x,int y) {for(;x<=n+1;x+=lb(x)) s[x]+=y;}
  int qry(int x,int y=0) {for(;x;x-=lb(x)) y+=s[x]; return y;}
  void add(int l,int r,int x) {add(l,x), add(r+1,-x);}
}

int query(int S,int T,int u) {
  auto itx=sc.upper_bound(S);
  if(*itx>=T) {
    if(!sc.count(S)) {
      int ans=0;
      per(h,20,0) if(fa[S][h]&&fa[S][h]<=T) ans+=sum[S][h], S=fa[S][h];
      return ans+b[S]*(s[T-1]-s[S-1]); 
    } else return b[S]*(s[T-1]-s[S-1]);
  }
  int x=*itx, bt=b[T], fls=0;
  if(!sc.count(S)) sc.insert(S), fls=1;
  int y=lower_bound(s,s+n,s[T-1]-u)-s+1; y=qmin(max(S,y),T-1).se;
  if(y==S) return b[S]*(s[T-1]-s[S-1]);
  SegT::mdf(1,1,n,x); pii res(0,0);
  if(x<y) res=res+SegT::qry(1,1,n,x,y-1);
  assert(x<=y);
  int tmp=0; swap(tmp,b[T]); res=res+val(y,T); swap(tmp,b[T]);
  if(fls) sc.erase(S);
  if(fls&&b[S]>b[x]) res.se+=FenT::qry(dfn[S]);
  else if(b[S]>b[x]) res.se+=b[S]*(s[x-1]-s[S-1]);
  else res.fi+=b[S];
  SegT::mdf(1,1,n,x);
  return res.fi*u+res.se;
}

signed main() {
  n=read(), m=read(), tick=1;
  rep(i,1,n) a[i]=read();
  rep(i,1,n+1) s[i]=s[i-1]+a[i];
  rep(i,1,n) b[i]=read(); st[++top]=n+1;
  per(i,n,1) {
    while(b[st[top]]>=b[i]) --top;
    nxt[i]=st[top]; e[st[top]].eb(i);
    st[++top]=i;
  }
  dfs(n+1);
  rep(i,1,n) f[0][i]=pii(a[i],i), g[0][i]=pii(b[i],i);
  rep(h,1,20) rep(i,1,n) if(i+(1<<h)-1<=n)
    f[h][i]=max(f[h-1][i],f[h-1][i+(1<<h-1)]),
    g[h][i]=min(g[h-1][i],g[h-1][i+(1<<h-1)]);
  rep(i,1,m) {
    int s=read(), t=read(), u=read();
    if(qmax(s,t-1).fi>u) ans[i]=-1;
    else q[++tot]=(qry){s,t,u,i};
  }
  sort(q+1,q+tot+1,cmp);
  rep(i,1,n+1) sc.insert(i);
  SegT::build(1,1,n);
  rep(i,2,n) insd(i);
  while(!Q.empty()) {
    int x=Q.top().se, w=-Q.top().fi; Q.pop();
    if(!sc.count(x)) continue;
    auto itp=sc.lower_bound(x), itn=sc.upper_bound(x);
    int pre=*--itp, nxt=*itn;
    if(s[nxt-1]-s[pre-1]!=w) continue;
    while(tick<=tot) {
      if(q[tick].u>=w) break;
      ans[q[tick].id]=query(q[tick].s,q[tick].t,q[tick].u);
      ++tick;
    }
    if(tick>tot) break;
    sc.erase(x); insd(pre); insd(nxt);
    FenT::add(dfn[x],dfn[x]+sz[x]-1,(s[nxt-1]-s[x-1])*b[x]);
    SegT::mdf(1,1,n,x); SegT::mdf(1,1,n,pre); SegT::mdf(1,1,n,nxt);
  }
  while(tick<=tot) {
    ans[q[tick].id]=query(q[tick].s,q[tick].t,q[tick].u);
    ++tick;
  }
  rep(i,1,m) printf("%lld\n",ans[i]);
  return 0;
}