#include <bits/stdc++.h>

#define ALL(x) begin(x), end(x)
#define EVAL(x) #x " = " << (x)

using std::cin, std::cout;
using std::pair, std::tuple;

using i64 = int64_t;
using f64 = long double;
using str = std::string;

template <typename T>
using vec = std::vector<T>;

template <typename T, size_t n>
using arr = std::array<T, n>;

void print(const vec<pair<int, int>>& ans) {
  cout << "YES\n";
  cout << ans.size() << "\n";
  for (auto [p, q] : ans) cout << p << " " << q << "\n";
}

void solve() {
  int n, k;
  cin >> n >> k;

  vec<int> a(n), b(n);
  for (int& i : a) cin >> i, --i;
  for (int& i : b) cin >> i, --i;

  if (k == n) {
    cout << (a == b ? "YES\n0" : "NO") << "\n";
    return;
  }

  if (k == n - 1) {
    for (int i = 0; i < n; ++i) {
      if (a == b) {
        cout << "YES\n";
        cout << i << "\n";
        while (i--) cout << "2 1\n";
        return;
      }
      std::rotate(begin(a), begin(a) + 1, end(a));
    }
    cout << "NO\n";
    return;
  }

  if (k == 1) {
    cout << "YES\n";
    cout << n << "\n";
    for (int i = 0; i < n; ++i) {
      auto it = std::find(ALL(a), b[i]);
      int p = it - begin(a) + 1;
      a.erase(it);
      a.emplace(begin(a) + i, b[i]);
      cout << p << " " << i + 1 << "\n";
    }
    return;
  }

  if (k == 2) {
    vec<pair<int, int>> ans;
    for (int i = 0; i < n - 2; ++i) {
      if (a[i] == b[i]) continue;
      int j = std::find(ALL(a), b[i]) - begin(a);
      if (j == n - 1) {
        ans.emplace_back(n - 1, n - 2);
        std::swap(a[n - 3], a[n - 2]), std::swap(a[n - 2], a[n - 1]);
        --j;
      }
      ans.emplace_back(j + 1, i + 1);
      std::rotate(begin(a) + i, begin(a) + j, begin(a) + j + 2);
    }
    if (a == b)
      print(ans);
    else
      cout << "NO\n";
    return;
  }

  vec<int> c(n);
  for (int i = 0; i < n; ++i) c[b[i]] = i;
  for (int& i : a) i = c[i];

  if (k & 1) {
    vec<pair<int, int>> ans;
    auto swap = [&](int i) {
      std::swap(a[i], a[i + 1]);
      vec<pair<int, int>> res;
      while (i + k - 1 >= n) res.emplace_back(n - k + 1, 1), i -= n - k;
      res.emplace_back(i + 1, 1);
      ans.insert(end(ans), ALL(res));
      ans.insert(end(ans), (k + 1) >> 1, {1, 3});
      ans.emplace_back(2, 3);
      for (int i = res.size(); i--;)
        ans.emplace_back(res[i].second, res[i].first);
    };
    for (int i = n; i--;)
      for (int j = i; j < n - 1; ++j)
        if (a[j] > a[j + 1]) swap(j);
    print(ans);
  } else {
    vec<pair<int, int>> ans;
    auto rotr = [&](int i, int c) {
      std::rotate(begin(a) + i, begin(a) + i + 3 - c, begin(a) + i + 3);
      vec<pair<int, int>> res;
      while (i + k - 1 >= n) res.emplace_back(n - k + 1, 1), i -= n - k;
      res.emplace_back(i + 1, 1);
      ans.insert(end(ans), ALL(res));
      while (c--)
        ans.emplace_back(3, 1), ans.emplace_back(2, 3), ans.emplace_back(2, 3);
      for (int i = res.size(); i--;)
        ans.emplace_back(res[i].second, res[i].first);
    };
    for (int i = 0; i < n - 2; ++i) {
      int j = std::find(i + ALL(a), i) - begin(a);
      if (j == n - 1) rotr(j -= 2, 1);
      for (; j > i; --j) rotr(j - 1, 2);
    }
    if (std::is_sorted(ALL(a)))
      print(ans);
    else
      cout << "NO\n";
  }
}

auto main() -> int {
  std::ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin >> t;
  while (t--) solve();
}