#include <cstdio>
#include <cstring>
using namespace std;
int max(int a, int b)
{
    return a > b ? a : b;
}
struct HIGHNUM
{
    int NUM[10000], LEN;
    char STR[10000];
    HIGHNUM(int x = 0)
    {
        memset(NUM, 0, sizeof(NUM));
        memset(STR, 0, sizeof(STR));
        LEN = 0;
        NUM[0] = x;
        LEN = 1;
        while (NUM[LEN - 1] / 10)
        {
            NUM[LEN] = NUM[LEN - 1] / 10;
            NUM[LEN - 1] %= 10;
            LEN++;
        }
    }
    char *TOSTR()
    {
        for (int i = 0; i < LEN; i++)
            STR[i] = NUM[LEN - i - 1] + '0';
        STR[LEN] = '\0';
        return STR;
    }
};
HIGHNUM operator+(HIGHNUM A, HIGHNUM B)
{
    HIGHNUM SUM;
    int MAXLEN = max(A.LEN, B.LEN), x;
    for (int i = 0; i < MAXLEN; i++)
    {
        SUM.NUM[i] = A.NUM[i] + B.NUM[i];
        x = SUM.NUM[i] / 10;
        SUM.NUM[i] %= 10;
    }
    SUM.LEN = MAXLEN;
    if (x)
        SUM.NUM[MAXLEN] = x, SUM.LEN++;
    return SUM;
}
HIGHNUM operator*(HIGHNUM A, int B)
{
    HIGHNUM SUM;
    int x = 0;
    for (int i = 0; i < A.LEN; i++)
    {
        SUM.NUM[i] += A.NUM[i] * B + x;
        x = SUM.NUM[i] / 10;
        SUM.NUM[i] %= 10;
    }
    SUM.LEN = A.LEN;
    while (x)
    {
        SUM.NUM[SUM.LEN] = x;
        x = SUM.NUM[SUM.LEN] / 10;
        SUM.NUM[SUM.LEN++] %= 10;
    }
    return SUM;
}
HIGHNUM max(HIGHNUM A, HIGHNUM B)
{
    if (A.LEN != B.LEN)
        return A.LEN > B.LEN ? A : B;
    else
        for (int i = A.LEN - 1; i >= 0; i--)
            if (A.NUM[i] != B.NUM[i])
                return A.NUM[i] > B.NUM[i] ? A : B;
    return A;
}
HIGHNUM base2[101], dp[101][101], sum;
int n, m;
int a[81];
int main()
{
    scanf("%d%d", &n, &m);
    base2[0] = HIGHNUM(1);
    for (int i = 1; i <= 100; i++)
        base2[i] = base2[i - 1] * 2;
    for (int k = 1; k <= n; k++)
    {
        for (int i = 1; i <= m; i++)
            for (int j = i; j <= m; j++)
                dp[i][j] = HIGHNUM(0);
        for (int i = 1; i <= m; i++)
            scanf("%d", a + i);
        for (int i = 1; i <= m; i++)
            for (int j = m; j >= i; j--)
            {
                dp[i][j] = max(dp[i][j], dp[i - 1][j] + base2[m - j + i - 1] * a[i - 1]);
                dp[i][j] = max(dp[i][j], dp[i][j + 1] + base2[m - j + i - 1] * a[j - 1]);
                // printf("dp[%d][%d]=%s;\n", i, j, dp[i][j].TOSTR());
            }
        HIGHNUM ans = HIGHNUM(0);
        for (int i = 1; i <= m; i++)
            ans = max(ans, dp[i][i] + base2[m] * a[i]);
        sum = sum + ans;
    }
    puts(sum.TOSTR());
    return 0;
}