//看看会不会爆int!数组会不会少了一维！//取物问题一定要小心先手胜利的条件#include <bits/stdc++.h>using namespace std;#define LL long long#define ALL(a) a.begin(), a.end()#define pb push_back#define mk make_pair#define fi first#define se secondconst int maxn = 1e5 + 5;vector<pair<int, int> > q[maxn];int pos[maxn], a[maxn], tree[maxn], ans[maxn];int n, m;inline int lowbit(int x){return x & -x;}void update(int x, int val){    for (int i = x; i <= n; i += lowbit(i)){        tree[i] += val;    }}int sum(int x){    int ans = 0;    for (int i = x; i > 0; i -= lowbit(i)){        ans += tree[i];    }    return ans;}int main(){    int t; cin >> t;    while (t--){        scanf("%d%d", &n, &m);        memset(pos, 0, sizeof(pos));        for (int i = 1; i <= n; i++) {            scanf("%d", a + i);            pos[a[i]] = i;            q[i].clear();        }        for (int i = 1; i <= m; i++){            int l, r; scanf("%d%d", &l, &r);            q[r].pb(mk(l, i));        }        memset(tree, 0, sizeof(tree));        for (int i = 1; i <= n; i++){            update(i, 1);            if (a[i] + 1 <= n && pos[a[i] + 1] < i) update(pos[a[i] + 1], -1);            if (a[i] - 1 >= 1 && pos[a[i] - 1] < i) update(pos[a[i] - 1], -1);            int len = q[i].size();            for (int j = 0; j < len; j++){                pair<int, int> p = q[i][j];                ans[p.second] = sum(i) - sum(p.first - 1);            }        }        for (int i = 1; i <= m; i++){            printf("%d\n", ans[i]);        }    }    return 0;}