// Problem: 
//     P1130 红牌
//   
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1130
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<algorithm>
//#include<cstdio>
#include<cstring>
#define ll long long 
#define endl '\n'
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define N 2010 //1e6+100 
 
using namespace std;
int n,m,x;
int mp[N][N];
int dp[N][N];
int main(){
	//ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	rep(i,1,m){
		rep(j,1,n){
			cin>>x;
			mp[j][i]=x;
		}
	}

	memset(dp,0x3f,sizeof dp);


	rep(i,0,m){
		dp[n][i]=mp[n][i];
	}
	per(i,n-1,1){
		rep(j,1,m){
			dp[i][j]=min(dp[i+1][j],dp[i+1][(j+1)%m+1])+mp[i][j];
		}
	}
	int MIN=1e9;
	rep(i,1,m){
		MIN=min(MIN,dp[1][i]);
	}
	cout<<MIN;
	return 0; 
}     
/*

2 3 4 2 
6 6 2 6 
1 2 3 1 
8 6 6 8 

*/