向下向右走

https://codeforces.com/contest/2049/problem/D

#include<bits/stdc++.h>
#define lc p<<1
#define rc p<<1|1
#define INF 1e18
using namespace std;
#define lowbit(x) x&(-x)
#define endl '\n'
using ll = long long;
using pii = pair<int,int>;
const double PI = acos(-1);
const int N=210;
ll a[N][N];
void solve(){
	ll n,m,w;cin>>n>>m>>w;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	vector<vector<vector<ll>>>dp(n+10,vector<vector<ll>>(m+10,vector<ll>(m+10,INF)));
	vector<vector<ll>> f(n+10,vector<ll>(m+10,INF));
	for(int k=0;k<m;k++){
		dp[1][0][k]=k*w;
	}		
	f[0][1]=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			for(int k=0;k<m;k++){
				dp[i][j][k]=min(f[i-1][j]+w*k,dp[i][j-1][k])+a[i][(j-1+k)%m+1];
				f[i][j]=min(f[i][j],dp[i][j][k]);
			}
		}
	}
	cout<<f[n][m]<<endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	
	return 0;
}