#include <bits/stdc++.h>

#define int int64_t

const int kMaxN = 2e5 + 5;

int n, m;
int a[kMaxN], b[kMaxN], sum[kMaxN], nxt[kMaxN];

int dist(int i, int j) {
  return sum[j - 1] - sum[i - 1];
}

int solve(int s, int t, int u) {
  int ret = 0, now = 0;
  for (int i = s; i < t; now -= a[i], ++i) {
    int dis = dist(i, std::min(t, nxt[i])), to = std::min(dis, u);
    ret += b[i] * (std::max(now, to) - now);
    now = std::max(now, to);
    if (now < a[i]) return -1;
  }
  return ret;
}

void dickdreamer() {
  std::cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    std::cin >> a[i];
    sum[i] = sum[i - 1] + a[i];
  }
  for (int i = 1; i <= n; ++i)
    std::cin >> b[i];
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n + 1; ++j) {
      if (b[j] < b[i]) {
        nxt[i] = j;
        break;
      }
    }
  }
  for (int i = 1; i <= m; ++i) {
    int s, t, u;
    std::cin >> s >> t >> u;
    std::cout << solve(s, t, u) << '\n';
  }
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}