#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=2e5+5;
int nums[maxn];
int v[maxn];
int prim[maxn],vis[maxn], len;
int sum[maxn],d[maxn];
inline void eular_shai(int n)        // n < N
{
    for(int i = 2;i <= n;i ++) 
    {
        if(! vis[i])
            prim[len ++] = i;
        for(int j = 0;j < len && i * prim[j] <= n; j ++) 
        {
            vis[i * prim[j]] = 1;
            if(i % prim[j] == 0)
                break;
        }
    }
}
void eular_num(int n)
{
    d[1] = 1;                       //1 特判
    for(int i = 2;i <= n;i ++) 
    {
        if(! vis[i]) 
        {
            prim[len ++] = i;
            sum[i] = 1;
            d[i] = 2;	            //质数的约数只有1和它本身
        }
        for(int j = 0; j < len && i * prim[j] <= n; j ++) 
        {
            vis[i * prim[j]] = 1;
            if(i % prim[j] == 0)
            {
                sum[i * prim[j]] = sum[i] + 1;
                d[i * prim[j]] = d[i] / (sum[i] + 1) * (sum[i] + 2);
                break;
            }
            sum[i * prim[j]] = 1;
            d[i * prim[j]] = d[i] * 2;
        }
    }
}
inline int gcd(int a,int b){
    return !b?a:gcd(b,a%b);
}
int val[maxn<<2];
inline void pushup(int p){
    val[p]=gcd(val[p<<1],val[p<<1|1]);
}
inline void build(int p,int l,int r){
    if(l==r){
        val[p]=v[l];
        return;
    }
    int mid=l+r>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    pushup(p);
}
inline void update(int p,int l,int r,int np,int nv){
    if(l==r){
        val[p]=nv;
        return;
    }
    int mid=l+r>>1;
    if(np<=mid)update(p<<1,l,mid,np,nv);
    else update(p<<1|1,mid+1,r,np,nv);
    pushup(p);
}
inline int query(int p,int l,int r,int st,int en){
    if(st<=l&&en>=r){
        return val[p];
    }
    int mid=l+r>>1;
    int gd=0;
    if(st<=mid)gd=gcd(gd,query(p<<1,l,mid,st,en));
    if(en>mid)gd=gcd(gd,query(p<<1|1,mid+1,r,st,en));
    return gd;
}
void slove(){
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>nums[i];
        v[i]=0;
    }
    for(int i=2;i<=n;i++){
        if(nums[i]<nums[i-1]){
            v[i]=i-1;
        }
    }
    build(1,1,n);
    if(n==1)cout<<1<<endl;
    else cout<<d[query(1,1,n,1,n)]<<'\n';
    auto change=[&](int x){
        if(nums[x]<nums[x-1]){
            update(1,1,n,x,x-1);
        }else update(1,1,n,x,0);
    };
    while(q--){
        int np,nv;
        cin>>np>>nv;
        nums[np]=nv;
        if(np>1)change(np);
        if(n==1)cout<<1<<endl;
        else cout<<d[query(1,1,n,1,n)]<<'\n';
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int _=1;
    cin>>_;
    eular_shai(maxn-1);
    eular_num(maxn-1);
    while(_--)slove();
}