#include <iostream>
using namespace std;
int n, m, a[2005][2005], dp[2005][2005], minn = 1000005;
int main() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++)
            cin >> a[j][i];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            dp[i][j] = min(dp[i - 1][j], (j == 1 ? dp[i - 1][m] : dp[i - 1][j - 1])) + a[i][j];
    for (int i = 1; i <= m; i++)
            minn = min(dp[n][i], minn);
    cout << minn;
    return 0;
}