#include<bits/stdc++.h>
using namespace std;
#define fe(i,a,b) for(int i=a;i<=b;i++)
typedef long long ll;
int n,m;
const int N= 2e6+5;
int Hash(int x,int y){
    return x*(m+1) + y+1;
}
ll a[N];
ll dp[N][4];
int main(){
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int kase=1;
    while(~scanf("%d%d",&n,&m)){
        fe(i,1,n)
            fe(j,1,m)
                scanf("%lld",&a[Hash(i,j)]);
        fe(i,0,n+1)
            fe(j,0,m+1)
                fe(k,0,3)
                    dp[Hash(i,j)][k]=-1e18;
        fe(i,1,n)
            fe(j,1,m)
                dp[Hash(i,j)][0] = max(a[Hash(i,j)],dp[Hash(i-1,j-1)][0]+a[Hash(i,j)]);
        for(int i=1;i<=n;i++)
            for(int j=m;j;j--)
                dp[Hash(i,j)][1] = max(a[Hash(i,j)],dp[Hash(i-1,j+1)][1]+a[Hash(i,j)]);
        for(int i=n;i;i--)
            fe(j,1,m)
                dp[Hash(i,j)][2] = max(a[Hash(i,j)],dp[Hash(i+1,j-1)][2]+a[Hash(i,j)]);
        for(int i=n;i;i--)
            for(int j=m;j;j--)
                dp[Hash(i,j)][3] = max(a[Hash(i,j)],dp[Hash(i+1,j+1)][3]+a[Hash(i,j)]);
        ll ans = -1e18;

        fe(i,2,n-1)
            fe(j,2,m-1){
                ll now = dp[Hash(i-1,j-1)][0]+dp[Hash(i-1,j+1)][1]
                    +dp[Hash(i+1,j-1)][2]+dp[Hash(i+1,j+1)][3]+a[Hash(i,j)];
                ans =max(ans,now);
            }
        printf("Case #%d: %lld\n",kase++,ans);

    }

    return 0;
}