#include <bits/stdc++.h>

#define ll long long
#define int long long
#define mod 1000000007

using namespace std;

ll gcd(ll a, ll b) {
    if(a < b) swap(a, b);
    if (b == 0) return a;
    return gcd(b, a % b);
}
ll it[800005];
ll uoc[200005];
ll a[200005];
void build(int index, int L, int R){
    if(L == R){
        it[index] = 0;
        return;
    }
    else{
        int mid = (L + R) / 2;
        build(index * 2, L, mid);
        build(index * 2 + 1, mid + 1, R);
        it[index] = 0;
    }
}
void update(int index, int L, int R, int u, int v, int val){
    if(R < u || L > v) return;
    if(u <= L && R <= v){
        it[index] = val;
        return;
    }
    int mid = (L + R) / 2;
    update(index * 2, L, mid, u, v, val);
    update(index * 2 + 1, mid + 1, R, u, v, val);
    it[index] = gcd(it[index * 2],  it[index * 2 + 1]);
}
ll get(int index, int L, int R, int l, int r){
    if(R < l || L > r) return 0;
    if(l <= L && R <= r) return it[index];
    int mid = (L + R) / 2;
    ll left = get(2*index, L, mid, l, r);
    ll right = get(2*index + 1, mid + 1, R, l, r);
    return gcd(left, right);

}
void solve(){
    
    int n, q;
    cin >> n >> q;
    uoc[0] = 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(1, 1, n, i, i, i);
        }
    }
    cout << uoc[it[1]] << endl;
    while(q--){
        int id, val;
        cin >> id >> val;
        if(id <  n){
            if(a[id] <= a[id+1] && val > a[id+1]){
                update(1, 1, n, id, id, id);
            }
            if(a[id] > a[id + 1] && val <= a[id + 1]){
                update(1, 1, n, id, id, 0);
            }
        }
        if(id > 1){
            if(a[id] >= a[id-1] && val < a[id-1]){
                update(1, 1, n, id-1, id-1, id-1);
            }
            if(a[id] < a[id - 1] && val >= a[id - 1]){
                update(1, 1, n, id-1, id-1, 0);
            }
            
            
        }
        cout << uoc[it[1]] << endl;
        a[id]  =val;
    }

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    for(int i = 1; i <= 200000; i++){
        for(int j = i; j <= 200000; j += i){
            uoc[j]++;
        }
    }
    int t;
    cin >> t;
    while(t--){
        
        solve();
    }

    return 0;
}