#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 145;
int nz[N+5], nb[N+5];
signed main(){
	int n, q, s, t, sum1 = 0, sum2=0;
	int a[N+5], b[N+5];
	cin >> n >> q;
	for(int i = 1; i <= n; i ++ ){
		cin >> a[i];
		sum1+= a[i];
	}
	bool flawed = false;
	for(int i = 1; i <= n; i ++ ){
		cin >> b[i];
		sum2+= b[i];
		if( a[i]+b[i] < 0 ){
			flawed = true;
		}
	}
	if( sum1 < 0 || sum2 < 0 ){
		flawed = 1;
	}
	for(int i = 2; i <= n; i ++ ){
		nz[ i ] = nz[i-1] + a[i-1]; 
	}
	nz[n+1] = nz[n] + a[n];
	for(int i = n; i >= 1; i -- ){
		nb[ i ] = nb[i+1] + b[i];
	}
	
//	cout << "nar zuv:";
//	for(int i = 1; i <= n+1; i ++ ){
//		cout << nz[i] << " ";
//	}
//	cout << "\n";
//	cout << "nar buruu:";
//	for(int i = 1; i <= n+1; i ++ ){
//		cout << nb[i] << " ";
//	}
//	cout << "\n";
	
	while( q -- ){
		cin >> s >> t;
		if( flawed ){
			cout << "flawed\n";
			continue;
		}
		if( s < t ){
			cout << min( nz[t]-nz[s], nb[1]-nb[s]+nb[t] ) << "\n";
		}else{
			cout << min( nb[t]-nb[s], nz[n+1]-nz[s]+nz[t] ) << "\n";
		}
	}
	
}