#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
} 
int T, n, q, ans;
int f[200010], d[200010], tr[800010];
vector<int> num[200010];
void build(int l, int r, int p) {
	if(l == r) {
		if(d[l] < 0) tr[p] = l - 1;
		else tr[p] = 0;
		return;
	}
	int mid = (l + r) / 2;
	build(l, mid,  p * 2);
	build(mid + 1, r, p * 2 + 1);
	if(tr[p	* 2] == 0 || tr[p * 2 + 1] == 0) tr[p] = max(tr[p * 2], tr[p * 2 + 1]);
	else tr[p] = __gcd(tr[p * 2], tr[p * 2 + 1]);
}
void update(int l, int r, int x, int p) {
	if(l == r) {
		if(d[l] < 0) tr[p] = l - 1;
		else tr[p] = 0;
		return;
	}
	int mid = (l + r) / 2;
	if(x <= mid) update(l, mid, x, p * 2);
	else update(mid + 1, r, x, p * 2 + 1);
	if(tr[p	* 2] == 0 || tr[p * 2 + 1] == 0) tr[p] = max(tr[p * 2], tr[p * 2 + 1]);
	else tr[p] = __gcd(tr[p * 2], tr[p * 2 + 1]);
}
void preDeal() {
	for(int i = 1; i <= 200000; ++i) {
		for(int j = 1; j <= sqrt(i); ++j) {
			if(i % j != 0) continue;
			if(j * j == i) num[i].push_back(j);
			else {
				num[i].push_back(j);
				num[i].push_back(i / j);
			}
		}
	}
	
}
void solve() {
	for(int i = 1; i <= n; ++i) {
		d[i] = f[i] - f[i - 1];
	}
	build(1, n, 1);
	int x, v;
	int ans = num[tr[1]].size();
	if(ans == 0) ans = n;
	cout << ans << endl;
	for(int i = 1; i <= q; ++i) {
		x = read();
		v = read();
		f[x] = v;
		d[x] = f[x] - f[x - 1];
		d[x + 1] = f[x + 1] - f[x];
		update(1, n, x, 1);
		if(x + 1 <= n) (1, n, x + 1, 1);
		ans = num[tr[1]].size();
		if(ans == 0) ans = n;
		cout << ans << endl;
	}
}
signed main() {
	T = read();
	preDeal();
	while(T) {
		T -= 1;
		n = read();
		q = read();
		for(int i = 1; i <= n; ++i) f[i] = read();
		solve();
	}
}