import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = readInt();
      auto A = new int[][](N, M);
      foreach (i; 0 .. N) {
        foreach (j; 0 .. M) {
          A[i][j] = readInt();
        }
      }
      
      auto dp = new bool[][](N + 1, K + 1);
      dp[0][0] = true;
      foreach (i; 0 .. N) {
        foreach (x; 0 .. K + 1) {
          if (dp[i][x]) {
            foreach (j; 0 .. M) {
              if (x + A[i][j] <= K) {
                dp[i + 1][x + A[i][j]] = true;
              }
            }
          }
        }
      }
      
      int ans = K + 1;
      foreach (x; 0 .. K + 1) {
        if (dp[N][x]) {
          chmin(ans, K - x);
        }
      }
      writeln((ans > K) ? -1 : ans);
    }
  } catch (EOFException e) {
  }
}