#include<iostream>
#include<string.h>
using namespace std;
const int MAXN = 5e5 + 50;
struct Edge {
	int x, y, w;
}edge[MAXN];
int n, m, bian, dist[MAXN], pre[MAXN];
int solve(int s, int t) {
	memset(dist, 127, sizeof(dist));
	dist[s] = 0;
	for (;;) {
		bool ok = false;
		for (int i = 1; i <= bian; i++) {
			int x = edge[i].x; int y = edge[i].y; int w = edge[i].w;
			if (dist[x] < 1 << 30) {
				if (dist[x] + w < dist[y]) {
					dist[y] = dist[x] + w;
					pre[y] = x;
					ok = true;
				}
			}
		}
		if (!ok)
			break;
	}
	return dist[t];
}
int main() {
	cin >> n >> m;
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		int cost; cin >> cost; int sale;
		for (int j = 0; j < min(m, n - i + 1); j++) {
			cin >> sale;
			edge[++cnt].x = i; edge[cnt].y = i + j + 1;
			edge[cnt].w = cost - sale;
		}
	}
	bian = cnt;
	cout << solve(1, n + 1) << endl;

	return 0;
}