cin >> m >> n;
    st = 1;
    en = (m+1)*n;
    for(int i=1; i<=2*m; i++)
    {
        if (i%2){
            int floor = i/2 + 1;
            for(int j=1; j<=n; j++) cin >> even[floor][j];
        }
        else{
            int floor = i/2;
            for(int j=1; j<n; j++) cin >> odd[floor][j];
        }
    }
    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n; j++)
        {
            int u = i*n + j;
            int uup = (i-1)*n + j;
            a[u].pb(ii(uup,even[i][j]));
            a[uup].pb(ii(u,even[i][j]));
            int udown = (i+1)*n+j;
            a[u].pb(ii(udown,even[i+1][j]));
            a[udown].pb(ii(u,even[i+1][j]));
            if (j==1){
                int v = u+1;
                a[u].pb(ii(v,odd[i][j]));
                a[v].pb(ii(u,odd[i][j]));
            }
            else if (j==n)
            {
                int v = u-1;
                a[u].pb(ii(v,odd[i][j-1]));
                a[v].pb(ii(u,odd[i][j-1]));
            }
            else{
                int v = u+1;
                a[u].pb(ii(v,odd[i][j]));
                a[v].pb(ii(u,odd[i][j]));
                v = u-1;
                a[u].pb(ii(v,odd[i][j-1]));
                a[v].pb(ii(u,odd[i][j-1]));
            }
        }
    }