#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
struct node {
  long long x, y;
  node() {}
  node(long long x, long long y) : x(x), y(y) {}
  bool operator<(const node& p) const { return x < p.x; }
};
vector<long long> a[200003], b[200003];
int main() {
  long long i, j, k, l, t, n, m, l1, l2, x, y, z;
  scanf("%lld %lld", &n, &m);
  z = 0;
  for (i = 0; i < n; i++) {
    long long mi = n;
    for (j = 0; j < m; j++) {
      scanf("%lld", &x);
      a[i].push_back(x);
      b[i].push_back(++z);
    }
  }
  long long ans = 0;
  for (i = 0; i < m; i++) {
    long long mi = n;
    map<long long, long long> mp;
    for (j = 0; j < n; j++) {
      x = a[j][i];
      long long pos = (x - i - 1) / m;
      if ((x - i - 1) % m == 0 && pos < n) {
        z = j - pos;
        if (z < 0) z += n;
        long long cnt = ++mp[z];
        mi = min(mi, z + (n - cnt));
      }
    }
    ans += mi;
  }
  deb(ans);
  return 0;
}
