#include <bits/stdc++.h>

struct SegmentTree {
  #define lson rt << 1
  #define rson rt << 1 | 1
  
  int n;
  std::vector<int> sum;
  std::vector<std::vector<int> > vec;

  SegmentTree() = default;
  SegmentTree(int _n) : n(_n) {
    sum = std::vector<int> (n << 2);
    vec = std::vector<std::vector<int> > (n << 2);
    Build(1, 0, n - 1);
  }

  void Build(int rt, int l, int r) {
    sum[rt] = r - l + 1;
    if (l == r) return;
    int mid = l + r >> 1;
    Build(lson, l, mid);
    Build(rson, mid + 1, r);
  }

  void Divide(int ql, int qr, int idx, int rt, int l, int r) {
    if (l >= ql && r <= qr) {
      vec[rt].emplace_back(idx);
      return;
    }
    int mid = l + r >> 1;
    if (ql <= mid) Divide(ql, qr, idx, lson, l, mid);
    if (qr > mid) Divide(ql, qr, idx, rson, mid + 1, r);
  }

  void Update(int add, long long &ans, std::vector<int> &vec, std::vector<int> &remain) {
    for (int x : vec) {
      int old = remain[x];
      remain[x] += add;
      if (remain[x] == 1) {
        ans += 1ll * (x + 1) * (x + 1);
      }
      else if (old == 1 && remain[x] == 0) {
        ans -= 1ll * (x + 1) * (x + 1);
      }
    }
  }

  void Modify(int p, int rt, int l, int r, long long &ans, std::vector<int> &remain) {
    --sum[rt];
    if (sum[rt] == 1) {
      Update(-(r - l), ans, vec[rt], remain);
    }
    else if (sum[rt] == 0) {
      Update(-1, ans, vec[rt], remain); 
    }

    if (l == r) return;
    int mid = l + r >> 1;
    if (p <= mid) Modify(p, lson, l, mid, ans, remain);
    else Modify(p, rson, mid + 1, r, ans, remain);
  }

  #undef lson
  #undef rson
};

void charming() {
  int n, m; std::cin >> n >> m;
  SegmentTree tree(n);
  long long ans = 0;
  std::vector<int> remain(m);
  for (int i = 0, l, r; i < m; ++i) {
    std::cin >> l >> r; remain[i] = r - l + 1;
    if (remain[i] == 1) ans += 1ll * (i + 1) * (i + 1);
    tree.Divide(l, r, i, 1, 0, n - 1);
  }

  std::cout << ans << ' ';
  for (int i = 0, a; i < n; ++i) {
    std::cin >> a;
    a = (1ll * a + ans) % n;

//    std::cout << "Change " << a << '\n';
    tree.Modify(a, 1, 0, n - 1, ans, remain);
    std::cout << ans << " \n"[i == n - 1];
  }
}

signed main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  int t; std::cin >> t;
  while (t--) charming();
  return 0;
}