#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<vector<int>> a;

int consistency(int n, int m, int t){

	vector<vector<bool>> dp(n+1, vector<bool>(5001, false));
	dp[0][0] = true;
	
	for(int i=1; i<=n; i++){
		for(int j=0; j<=5000; j++){
			
			for(int k=1; k<=m; k++){
				if(j-a[i-1][k-1] >= 0)
					dp[i][j] = dp[i][j] || dp[i-1][j-a[i-1][k-1]];
			}
		}
	}
	
	int ans = INF;
	for(int j=0; j<=5000; j++){
		if(dp[n][j] == true)	ans = min(ans, abs(j-t));
	}
	
	return ans;
}















int practice(int n, int m, int k){


    return 0;
}





void solve() {
    
	int n, m, k;
	cin >> n >> m >> k;
	
	a.resize(n, vector<int>(m));
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++) cin >> a[i][j];
	}
    
    cout << consistency(n, m, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}