#include <bits/stdc++.h>
using namespace std;
using T = long long;
int main() {
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	T sum = 0;
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
		sum += a[i];
	}
	while(q--) {
		int i, x;
		cin >> i >> x;
		sum += x - a[i];
		a[i]              = x;
		pair<T, int> best = {std::numeric_limits<T>::max(), -1};
		long long ls      = 0;
		for(int i = 0; i < n; ++i) {
			auto rs = sum - ls - a[i];
			pair<T, int> p{abs(abs(ls - rs)-a[i]%2), i};
			best = min(best, p);
			ls += a[i];
		}
		cout << best.second << '\n';
	}
	return 0;
}