#include <iostream>
#include <set>
#include <vector>
using namespace std;

int main() {
  int n, r, t;
  while ((cin >> n) && (n != 0) && (cin >> r >> t)) {
    vector<vector<int> > d(n, vector<int>(n));
    for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      cin >> d[i][j];
    int diameter = 0;
    for (int i = 0; i < n; i++)
    for (int j = i+1; j < n; j++) {
      set<int> diffs;
      for (int k = 0; k < n; k++)
        diffs.insert(d[k][i] - d[k][j]);
      int temp = d[i][j] * r + (int(diffs.size()) - 2) * t;
      if (diameter < temp) diameter = temp;
    }
    cout << diameter << endl;
  }
  return 0;
}