#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
int64_t rll() {
	long long n;
	scanf("%lld", &n);
	return n;
}

int main() {
	int n = ri(), real_k = ri();
	std::pair<int, int> a[n];
	for (int i = 0; i < n; i++) a[i] = {ri(), i};
	int q = ri();
	int x[q], v[q];
	for (int i = 0; i < q; i++) {
		x[i] = ri() - 1;
		v[i] = ri();
	}
	int pos[n];
	for (int i = 0; i < n; i++) pos[i] = i;
	for (int i = 0; i < q; i += 100) {
		std::map<int, int> cnt;
		for (int j = i; j < q && j < i + 100; j++) {
			cnt[x[j]]++;
		}
		std::pair<int, int> new_a[n];
		int cur = 0;
		for (int i = 0; i < n; i++) {
			if (!cnt.count(a[i].second)) new_a[cur++] = a[i];
		}
		for (auto i : cnt) new_a[cur++] = a[pos[i.first]];
		assert(cur == n);
		memcpy(a, new_a, sizeof(new_a));
		for (int i = 0; i < n; i++) pos[a[i].second] = i;
		std::bitset<15001> set[n + 1];
		set[0] = std::bitset<15001>(1);
		for (int i = 0; i < n; i++) set[i + 1] = set[i] | set[i] << a[i].first;
		for (int j = i; j < q && j < i + 100; j++) {
			int k = pos[x[j]];
			a[k].first = v[j];
			for (int l = k; l < n; l++) set[l + 1] = set[l] | set[l] << a[l].first;
			std::cout << set[n][real_k] << std::endl;
		}
	}
	
	return 0;
}