#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long LL;
const int N = 2e5 + 10, M = 1e6 + 10;

int n, q;
int g[N << 2], a[N];
vector<int> fac[N];

namespace Silverwolf{
    LL gcd(LL a, LL b) {
        return b ? gcd(b, a % b) : a;
    }
}

void init(){
    for(int i = 1; i <= n; i ++) a[i] = 0;
    for(int i = 1; i <= 4 * n ; i ++) g[i] = -1;
    // for(int i = 0; i <= 4 * n; i ++) tree[i] = 0;
}

void push_up(int p) {
    if(g[p << 1] == -1) g[p] = g[p << 1 | 1];
    else if(g[p << 1 | 1] == -1) g[p] = g[p << 1];
    else g[p] = Silverwolf::gcd(g[p << 1], g[p << 1 | 1]);
}

void build(int p, int pl, int pr) {
    g[p] = -1;
    if(pl == pr) return;
    int mid = (pl + pr) >> 1;
    build(p << 1, pl, mid);
    build(p << 1 | 1, mid + 1, pr);
}

void update(int pos, int p, int pl, int pr, int k) {
    if (pl == pr) {
        if(k == -1) g[p] = -1;
        else g[p] = pl;
        return;
    }
    int mid = (pl + pr) >> 1;
    if (pos <= mid) update(pos, p << 1, pl, mid, k);
    else update(pos, p << 1 | 1, mid + 1, pr, k);
    push_up(p);
}

void solve() {
    cin >> n >> q;
    build(1, 1, n);
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i < n; i ++) {
        if (a[i] > a[i + 1]) update(i, 1, 1, n, 1);
    }
    if(g[1] == -1) cout << n << endl;
    else cout << fac[g[1]].size() << endl;
    // cout << g[1] << endl;
    // for(int i = 1; i <= 9; i ++) cout << g[i] << ' ';
    // cout << endl;
    while (q --) {
        // cout << q << endl;
        int pos, x;
        cin >> pos >> x;
        if(pos < n && a[pos] <= a[pos + 1] && x > a[pos + 1]) update(pos, 1, 1, n, 1);
        if(pos < n && a[pos] > a[pos + 1] && x <= a[pos + 1]) update(pos, 1, 1, n, -1);
        // cout << "_________" << endl;
        // cout << a[pos - 1] << ' ' << a[pos] << ' ' << x << endl; 
        if(pos > 1 && a[pos - 1] <= a[pos] && x < a[pos - 1]) update(pos - 1, 1, 1, n, 1);
        if(pos > 1 && a[pos - 1] > a[pos] && x >= a[pos - 1]) update(pos - 1, 1, 1, n, -1);
        // for(int i = 1; i <= 9; i ++) cout << g[i] << ' ';
        // cout << endl;
        a[pos] = x;
        if(g[1] == -1) cout << n << endl;
        else cout << fac[g[1]].size() << endl;
        // cout<< g[1] << endl;
    }
    init();
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    for(int i = 1; i <= 2e5; i ++){
        for(int j = 1; i * j <= 2e5; j ++){
            fac[i * j].push_back(i);
        }
    }
    while (t--) {
        solve();
    }
    return 0;
}