import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


void main() {
  try {
    for (; ; ) {
      const M = readInt;
      const K = readInt;
      auto A = new int[M * K];
      foreach (i; 0 .. M * K) {
        A[i] = readInt;
      }
      
      auto B = new int[M * K];
      {
        auto cnt = new int[M];
        foreach (i; 0 .. M * K) {
          B[i] = cnt[A[i]]++;
        }
      }
      auto posss = new int[][M];
      {
        auto cnt = new int[K];
        foreach (i; 0 .. M * K) {
          posss[A[i]] ~= cnt[B[i]]++;
        }
      }
      debug {
        writeln("A = ", A);
        writeln("B = ", B);
        writeln("posss = ", posss);
      }
      
      auto anss = new long[M];
      auto bit = new int[M * K];
      foreach (i; 0 .. M * K) {
        const val = B[i] * M + A[i];
        anss[0] += (i - bit.bSum(val));
        bit.bAdd(val, 1);
      }
      foreach (a; 0 .. M - 1) {
        long sum = anss[a];
        foreach (pos; posss[a]) {
          sum += (M - 1 - 2 * pos);
        }
        anss[a + 1] = sum;
      }
      
      debug {
        writeln("anss = ", anss);
      }
      const ans = anss.minElement;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}