#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int inf = 0x7ffffff;

int n, m, t, k, h, atk,f[][][],a[][],ans = inf;

int jisuan(int xue, int gongji)

{

    return(h - ) / gongji * xue;

}

void dfs(int x,int y,int cur,int xue,int gongji,int depth)

{

    if (depth > k)

    {

        f[x][y][cur + ] = min(f[x][y][cur + ], xue);

        return;

    }

    if (x +  <= n)

        dfs(x + , y, cur, xue + jisuan(a[x + ][y],gongji + a[x + ][y]), gongji + a[x + ][y], depth + );

    if (y +  <= m)

        dfs(x, y + , cur, xue + jisuan(a[x][y + ], gongji + a[x][y + ]), gongji + a[x][y + ], depth + );

}

int main()

{

    scanf("%d%d%d%d%d%d", &n, &m, &t, &k, &h, &atk);

    for (int i = ; i <= n; i++)

        for (int j = ; j <= m; j++)

            scanf("%d", &a[i][j]);

    for (int i = ; i <= n; i++)

        for (int j = ; j <= m; j++)

            for (int l = ; l <= t; l++)

                f[i][j][l] = inf;

    f[][][] = ;

    for (int i = ; i <= n; i++)

        for (int j = ; j <= m; j++)

            for (int l = ; l <= t; l++)

            {

                if (l != t)

                    dfs(i, j, l, f[i][j][l], atk,);

                if (i +  <= n)

                    f[i + ][j][l] = min(f[i + ][j][l], f[i][j][l] + jisuan(a[i + ][j], atk));

                if (j +  <= m)

                    f[i][j + ][l] = min(f[i][j + ][l], f[i][j][l] + jisuan(a[i][j + ], atk));

            }

    for (int i = ; i <= t; i++)

        ans = min(ans, f[n][m][i]);

    printf("%d\n", ans);

    return ;

}