#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define ft first
#define sd second
#define vec vector
#define pushk push_back
#define ump unordered_map
#define pl p<<1
#define pr p<<1|1
using namespace std;
const int N = 2e5 + 10, M = 2e6 + 10, mod = 1e9+7;
const ll inf = 1e18;
const ld eps = 1e-13;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy, _ = 1, __ = 1;
void bout(bool f) {
    if (f)cout << "YES\n";
    else cout << "NO\n";
}
ll n, m, k;
int seg[N<<2],a[N],cnt[N];

void upd(int s,int t,int p,int k,int x) {
    if(s==t) {
        seg[p]=x; return ;
    }
    int m=s+t>>1;
    if(k<=m)upd(s,m,pl,k,x);
    else upd(m+1,t,pr,k,x);
    seg[p]=__gcd(seg[pl],seg[pr]);
}

void ini(){
    for(int i=1;i<N;++i) {
        for(int j=1;i*j<N;++j) {
            ++cnt[i*j];
        }
    }
}
void solve() {
    cin>>n>>m;
    for(int i=1;i<=n;++i)cin>>a[i];
    for(int i=1;i<n;++i) {
        if(a[i]>a[i+1])upd(1,n,1,i,i);
    }
    cnt[0]=n;
    cout<<cnt[seg[1]]<<'\n';
    int x,y,z;
    for(int i=1;i<=m;++i) {
        cin>>x>>y;
        a[x]=y;
        if(x<n) {
            if(a[x]>a[x+1])upd(1,n,1,x,x);
            else upd(1,n,1,x,0);
        }
        if(x>1) {
            if(a[x-1]>a[x])upd(1,n,1,x-1,x-1);
            else upd(1,n,1,x-1,0);
        }
        cout<<cnt[seg[1]]<<'\n';
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifndef ONLINE_JUDGE
    streambuf *cinbp=cin.rdbuf(),*coutbp=cout.rdbuf();
    ifstream fin("in.txt");
    ofstream fout("out.txt");
    cin.rdbuf(fin.rdbuf());
    cout.rdbuf(fout.rdbuf());
#endif
    cin >> _;
    __ = _;
    ini();
    while (_--) {
        solve();
    }
    return 0;
}