#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef pair<int, int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int T;
int n, m, a[N], len[N];
#define ls (n << 1)
#define rs (n << 1 | 1)

int t[N << 2], lazy[N << 2];

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

void pushup(int n)
{
    t[n] = gcd(t[ls], t[rs]);
}

void pushdown(int n)
{
    if (lazy[n])
    {
        lazy[ls] = lazy[rs] = lazy[n];
        t[ls] = t[rs] = lazy[n];
        lazy[n] = 0;
    }
}

void create(int n, int l, int r)
{
    t[n] = 0;
    lazy[n] = 0;
    if (l == r)
    {
        t[n] = len[l];
        return;
    }
    int mi = l + r >> 1;
    create(ls, l, mi);
    create(rs, mi + 1, r);
    pushup(n);
}

void update(int n, int l, int r, int sl, int sr, int w)
{
    if (l > sr || r < sl)
    {
        return;
    }
    if (l >= sl && r <= sr)
    {
        t[n] = w;
        lazy[n] = w;
        return;
    }
    int mi = l + r >> 1;
    pushdown(n);
    update(ls, l, mi, sl, sr, w);
    update(rs, mi + 1, r, sl, sr, w);
    pushup(n);
}

int answer(int n, int l, int r, int sl, int sr)
{
    if (l > sr || r < sl)
    {
        return 0;
    }
    if (l >= sl && r <= sr)
    {
        return t[n];
    }
    int mi = l + r >> 1;
    pushdown(n);
    int g = 0;
    g = gcd(g, answer(ls, l, mi, sl, sr));
    g = gcd(g, answer(rs, mi + 1, r, sl, sr));
    return g;
}
long long cnt[N];
void init()
{
    for (int i = 1; i <= 200001; i++)
        for (int j = 1; j * i <= 200001; j++)
            cnt[i * j]++;
}
set<int> st;
int rpos[N];
void solve()
{
    // code
    st.clear();
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        rpos[i] = 0;
        len[i] = 1;
    }
    for (int i = 1; i <= n; i++)
    {
        int j = i;
        while (j + 1 <= n && a[j] <= a[j + 1])
        {
            j++;
        }
        for (int k = i; k <= j; k++)
        {
            len[k] = (j - i + 1);
        }
        st.insert(i);
        rpos[i] = j;
        i = j;
    }
    create(1, 1, n);
    int l = *st.rbegin();
    int g = answer(1, 1, n, 1, l - 1);
    if (g == 0 || l == 1)
    {
        cout << n << '\n';
    }
    else
    {
        cout << cnt[g] << '\n';
    }
    while (m--)
    {
        int pos, v;
        cin >> pos >> v;
        a[pos] = v;
        auto nl = st.lower_bound(pos);
        int l = *nl, r = rpos[l];
        if (l <= pos - 1)
        {
            rpos[l] = pos - 1;
            update(1, 1, n, l, pos - 1, pos - l);
        }
        st.insert(pos);
        rpos[pos] = pos;
        update(1, 1, n, pos, pos, 1);
        if (pos + 1 <= r)
        {
            st.insert(pos + 1);
            rpos[pos + 1] = r;
            update(1, 1, n, pos + 1, r, r - pos);
        }
        nl = st.find(pos);
        if (st.size() == 1)
        {
            cout << n << '\n';
            continue;
        }
        if (*nl == *st.begin())
        {
            auto rq = nl;
            rq++;
            int rl = *rq, rr = rpos[rl];
            if (a[pos] <= a[rl])
            {
                st.erase(rl);
                rpos[pos] = rr;
                update(1, 1, n, pos, rr, rr - pos + 1);
            }
        }
        else if (*nl == *st.rbegin())
        {
            auto lq = nl;
            lq--;
            int ll = *lq, lr = rpos[ll];
            if (a[pos] >= a[lr])
            {
                st.erase(pos);
                rpos[ll] = pos;
                update(1, 1, n, ll, pos, pos - ll + 1);
            }
        }
        else
        {
            auto lq = nl;
            lq--;
            auto rq = nl;
            rq++;
            int l1 = *lq, l2 = rpos[l1];
            int r1 = *rq, r2 = rpos[r1];
            if (a[pos] >= a[l2] && a[pos] <= a[r1])
            {
                st.erase(pos);
                st.erase(r1);
                rpos[l1] = r2;
                update(1, 1, n, l1, r2, r2 - l1 + 1);
            }
            else if (a[pos] >= a[l2])
            {
                st.erase(pos);
                rpos[l1] = pos;
                update(1, 1, n, l1, pos, pos - l1 + 1);
            }
            else if (a[pos] <= a[r1])
            {
                st.erase(r1);
                rpos[pos] = r2;
                update(1, 1, n, pos, r2, r2 - pos + 1);
            }
        }
        int x = *st.rbegin();
        int g = answer(1, 1, n, 1, x - 1);
        if (g == 0 || x == 1)
        {
            cout << n << '\n';
        }
        else
        {
            cout << cnt[g] << '\n';
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    init();
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}