// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
  
using namespace std;
  
#define i64 long long
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
  
const int MAXN = 5e5 + 5;
const i64 INF = LLONG_MAX/2;
int N, Q;
i64 a[MAXN], b[MAXN], prefa[MAXN], prefb[MAXN];
void Solve(void) {
  cin >> N >> Q;
  for (int i = 1; i <= N; i ++) cin >> a[i];
  for (int i = 1; i <= N; i ++) cin >> b[i];
  bool flawed = false;
  for (int i = 1; i <= N; i ++) {
    if (a[i] + b[i] < 0) flawed = true;
    prefa[i] = prefa[i - 1] + a[i];
    prefb[i] = prefb[i - 1] + b[i];
  }
  if (prefa[N] < 0 || prefb[N] < 0) flawed = true;
  while (Q --) {
    int u, v; cin >> u >> v;
    if (flawed) cout << "flawed"<< "\n";
    else {
      i64 ans = 2 * INF;
      if (u <= v) {
        ans = min(ans, prefa[v - 1] - prefa[u - 1]);
        ans = min(ans, prefb[u - 1] + prefb[N] - prefb[v - 1]);
      } else {
        ans = min(ans, prefb[u - 1] - prefb[v - 1]);
        ans = min(ans, prefa[v - 1] + prefa[N] - prefa[u - 1]);
      }
      cout << ans << "\n";
    }
  }

}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout << fixed << setprecision(10);
  int Tests = 1; // cin >> Tests; 
  while (Tests --) {
    Solve();    
  }
}