#include <bits/stdc++.h>
using namespace std;
const int maxn = 71, INF = 1e9 + 7;
int a[maxn][maxn], dp[maxn][maxn][maxn][maxn];
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 0; i < maxn; i++)
    for (int j = 0; j < maxn; j++)
      for (int cnt = 0; cnt < maxn; cnt++)
        for (int rem = 0; rem < maxn; rem++) dp[i][j][cnt][rem] = -INF;
  dp[0][0][0][0] = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      for (int cnt = 0; cnt <= m / 2; cnt++)
        for (int rem = 0; rem < k; rem++) {
          int ni = (j == m - 1 ? i + 1 : i);
          int nj = (j == m - 1 ? 0 : j + 1);
          if (ni != i) {
            dp[ni][nj][0][rem] = max(dp[ni][nj][0][rem], dp[i][j][cnt][rem]);
          } else {
            dp[ni][nj][cnt][rem] =
                max(dp[ni][nj][cnt][rem], dp[i][j][cnt][rem]);
          }
          if (cnt + 1 <= m / 2) {
            int nrem = (rem + a[i][j]) % k;
            if (i != ni) {
              dp[ni][nj][0][nrem] =
                  max(dp[ni][nj][0][nrem], dp[i][j][cnt][rem] + a[i][j]);
            } else {
              dp[ni][nj][cnt + 1][nrem] =
                  max(dp[ni][nj][cnt + 1][nrem], dp[i][j][cnt][rem] + a[i][j]);
            }
          }
        }
  cout << max(0, dp[n][0][0][0]) << endl;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}
