#include <cstdio>
#include <vector>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 2e5 + 100;

int ans[MAXN];

int cnt(int x)
{
    int num = 1;
    for (int i = 2; i * i <= x; ++i)
        if (!(x % i))
        {
            int temp = 0;
            while (!(x % i))
                x /= i, temp++;
            num *= (temp + 1);
        }
    return x == 1 ? num : num * 2;
}

void get_ans()
{
    for (int i = 1; i <= 200000; ++i)
        ans[i] = cnt(i);
    return;
}

int tree[MAXN << 2], a[MAXN], g[MAXN], n, m;

int ls(int x)
{
    return x << 1;
}

int rs(int x)
{
    return (x << 1) | 1;
}

int mid(int l, int r)
{
    return l + ((r - l) >> 1);
}

void maintain(int x)
{
    tree[x] = __gcd(tree[ls(x)], tree[rs(x)]);
}

void build(int l, int r, int x)
{
    // cout << "l:" << l << " r:" << r << " x:" << x << "\n";
    if (l == r)
    {
        tree[x] = g[l];
        return;
    }
    int m = mid(l, r);
    build(l, m, ls(x)), build(m + 1, r, rs(x));
    maintain(x);
}

void modify(int l, int r, int x, int p, int num)
{
    if (l == r && l == x)
    {
        tree[p] = num;
        return;
    }
    if (mid(l, r) >= x)
        modify(l, mid(l, r), x, ls(p), num);
    if (x > mid(l, r))
        modify(mid(l, r) + 1, r, x, rs(p), num);
    maintain(p);
}

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

void solve()
{
    init();
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n - 1; ++i)
        if (a[i] > a[i + 1])
            g[i] = i;
    if (n == 1)
    {
        cout << 1 << "\n";
        return;
    }
    // for (int i = 1; i <= n; ++i)
    //     cout << g[i] << " \n"[i == n];
    build(1, n, 1);
    cout << ans[tree[1]] << "\n";
    while (m--)
    {
        int x, w;
        cin >> x >> w;
        if (x == n)
            continue;
        a[x] = w;
        if (!g[x])
        {
            if (a[x] > a[x + 1])
            {
                g[x] = x;
                modify(1, n, x, 1, x);
            }
        }
        else
        {
            if (a[x] <= a[x + 1])
            {
                g[x] = 0;
                modify(1, n, x, 1, 0);
            }
        }
        if (!g[x - 1])
        {
            if (a[x - 1] > a[x])
            {
                g[x - 1] = x - 1;
                modify(1, n, x - 1, 1, x - 1);
            }
        }
        else
        {
            if (a[x - 1] <= a[x])
            {
                g[x - 1] = 0;
                modify(1, n, x - 1, 1, 0);
            }
        }
        cout << ans[tree[1]] << '\n';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    get_ans();
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}