#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <sstream>
#include <cstdlib>
#include <ctime>

using namespace std;

int n, nleft, ntot;
int a[100][100],g[100][100],flag[100];

void findtree()
{
  nleft = n, ntot=n;
  int i,j,k,val,diff,succ;
  while(nleft>1){
    if (nleft==2){
      for(i=0;i<ntot;i++) if (!flag[i]) break;
      for(j=i+1;j<ntot;j++) if (!flag[j]) break;
      g[i][j]=g[j][i]=a[i][j];
      break;
    }
    succ=0;
    for(i=0;i<ntot;i++) if (!flag[i]){
      for(j=i+1;j<ntot;j++) if (!flag[j]){
        val=-1;
        for(k=0;k<ntot;k++) if (k!=i && k!=j && !flag[k]){
          diff=a[i][k]-a[j][k];
          if (val!=-1 && val!=diff) break;
         val=diff;
        }
        if (k==ntot){
          g[ntot][i]=g[i][ntot]=(a[i][j]+diff)/2;
          g[ntot][j]=g[j][ntot]=(a[i][j]-diff)/2;
          for(k=0;k<ntot;k++) if (k!=i && k!=j && !flag[k]){
            a[ntot][k]=a[k][ntot]=a[i][k]-g[i][ntot];
          }
          flag[i]=1;
          flag[j]=1;
          ntot++;
          nleft--;
          succ=1;
          break;
        }
      }
      if (succ) break;
    }
  }
}

int t1,t2;
int v[101];

void dfs(int cur,int dis){
  if (v[cur]>=0) return;
  int i;
  v[cur]=dis;
  for(i=0;i<ntot;i++) if (g[cur][i]!=-1){
    if (g[cur][i]==0) dfs(i,dis);
    else dfs(i,dis+g[cur][i]*t1+t2*2);
  }
}

int findmax()
{
  int i,j,mtime=0;
  for(i=0;i<n;i++){
    memset(v,0xff,sizeof(v));
    dfs(i,0);
    for(j=0;j<n;j++) if (v[j]>mtime) mtime=v[j];
  }
  return mtime/2-t2;
}

int main()
{
//  freopen("test.txt","r",stdin);
  int i,j;
  while(1){
    scanf("%d",&n);
    if (!n) break;
    scanf("%d%d",&t1,&t2);
    memset(a,0,sizeof(a));
    for(i=0;i<n;i++){
      for(j=0;j<n;j++){
        scanf("%d",&a[i][j]);
        a[i][j]*=2;
      }
    }
    if (n==1){
      printf("0\n");
      continue;
    }
    memset(flag,0,sizeof(flag));
    memset(g,0xff,sizeof(g));
    findtree();
    printf("%d\n",findmax());
  }
  return  0;
}