#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1 &x, const T2 &y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1 &x, const T2 &y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1 &x, const T2 &y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1 &x, const T2 &y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
struct _flag_t {
  string val;
} const _1d{", "}, _2d{"\n  "};
_flag_t _flag = _1d;
ostream &operator<<(ostream &os, _flag_t flag) {
  _flag = flag;
  return os;
}
template <class It>
ostream &_out(ostream &os, It f, It l) {
  if (f == l) return os << "{}";
  _flag_t cur_flag = _flag;
  os << _1d << "{ " << *f;
  for (; ++f != l; os << cur_flag.val << *f)
    ;
  return os << " }";
}
template <class C>
auto operator<<(ostream &os, C const &cont)
    -> decltype(begin(cont), end(cont), cont.size(), declval<ostream &>()) {
  return _out(os, begin(cont), end(cont));
}
ostream &operator<<(ostream &os, string const &s) { return os << s.data(); }
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
  return os << "[" << p.first << ", " << p.second << "]";
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2000;
int n, m;
int a[MAXN][MAXN];
int b[MAXN][MAXN];
vector<int> x[MAXN], y[MAXN];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> a[i][j];
      x[i + j - 1].push_back(a[i][j]);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> b[i][j];
      y[i + j - 1].push_back(b[i][j]);
    }
  }
  for (int i = 1; i <= n + m - 1; i++) {
    sort(x[i].begin(), x[i].end());
    sort(y[i].begin(), y[i].end());
    if (x[i] != y[i]) {
      return cout << "NO", 0;
    }
  }
  cout << "YES";
}
