#include<bits/stdc++.h>

using namespace std;

const int N=505;

int n,m,a[N][N],b[N][N];
bool vis[N];
int L[N][N],R[N][N],rec_del[N],fa[N],sz[N];
short LCP[N][N][N];
vector<int> rec[N],del[N];

int get(int x){ return fa[x]==x?x:fa[x]=get(fa[x]); }

int main(){
  //freopen("in.in","r",stdin);
  //cerr<<(sizeof(LCP)/1024.0/1024);

  cin.tie(0),cout.tie(0)->sync_with_stdio(false);

  cin>>n>>m;
  for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
      char c;
      cin>>c;
      a[i][j]=(c=='1');
    }
  }
  for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
      char c;
      cin>>c;
      b[i][j]=(c=='1');
    }
  }

  for(int i=1; i<=n; i++){
    for(int j=m; j>0; j--){
      for(int k=m; k>0; k--){
        if(a[i][j]==b[i][k]){
          LCP[i][j][k]=LCP[i][j+1][k+1]+1;
        }
      }
    }
  }

  auto lcp=[&](int i,int x,int y){
    return LCP[i][x][y];
  };

  int Low_b=0;
  for(int i=1; i<=n; i++){
    int flag=0;
    for(int j=1; j<=m; j++){
      if(a[i][j]!=b[i][j]){
        flag=1;
        break;
      }
    }
    if(flag){
      break;
    }
    Low_b=i;
  }

  int Up_b=n+1;
  for(int i=n; i>0; i--){
    int flag=0;
    for(int j=1; j<=m; j++){
      if(a[i][j]!=b[i][j]){
        flag=1;
        break;
      }
    }
    if(flag){
      break;
    }
    Up_b=i;
  }
  Up_b--;
  Low_b++;

  for(int d=1; d<m; d++){
    int ans=-1;
    for(int i=1; i<=n; i++){
      int cnt=m+1;
      for(int j=m; j>0; j--){
        if(a[i][j]!=b[i][j]) break;
        cnt=j;
      }
      cnt--;
      int cc=0;
      for(int j=1; j<=m; j++){
        if(a[i][j]!=b[i][j]) break;
        cc=j;
      }
      cc++;
      int lst=0;
      for(int j=1; j<=m; j++){
        L[i][j]=lst+d;
        if(a[i][j]!=b[i][j]){
          lst=j;
        }
        if(j<=d||j-d>cc){
          L[i][j]=m+1,R[i][j]=0;
          continue;
        }
        L[i][j]=max(L[i][j],j);
        L[i][j]=max(L[i][j],cnt);
        R[i][j]=j+lcp(i,j,j-d)-1;
      }

      //cerr<<cc<<endl;

      /*
      for(int j=1; j<=m; j++){
        cerr<<"at "<<d<<' '<<i<<' '<<j<<' '<<L[i][j]<<' '<<R[i][j]<<endl;
      }*/
    }
    //cerr<<endl;

    int sum=0;
    for(int l=1; l<=m; l++){
      if(Low_b<=Up_b){
        int nowL=0,nowR=m;
        for(int i=1; i<=n; i++){
          if(i>=Low_b&&i<=Up_b){
            nowL=max(nowL,L[i][l]);
            nowR=min(nowR,R[i][l]);
          }
        }

        for(int i=1; i<=n; i++){
          vis[i]=0;
          if(L[i][l]>R[i][l]) continue;
          rec[L[i][l]].emplace_back(i);
          del[R[i][l]+1].emplace_back(i);
        }

        for(int r=l; r<=m; r++){
          for(auto p:rec[r]){
            vis[p]=1;
          }
          for(auto p:del[r]){
            vis[p]=0;
          }
          rec[r].clear();
          del[r].clear();
          if(nowL<=r&&r<=nowR){
            //cerr<<nowL<<' '<<nowR<<' '<<Low_b<<' '<<Up_b<<endl;
            //for(int i=Low_b; i<=Up_b; i++){
            //  assert(vis[i]);
            //}
            int cc0=0;
            for(int i=Low_b-1; i>0; i--){
              if(vis[i]) cc0++;
              else break;
            }
            int cc1=0;
            for(int i=Up_b+1; i<=n;i++){
              if(vis[i]) cc1++;
              else break;
            }

            /*
            //cerr<<Up_b<<' '<<Low_b<<' '<<cc0<<' '<<cc1<<endl;
            cerr<<"at "<<d<<' '<<l<<' '<<r-l+1<<' '<<Low_b<<' '<<Up_b<<' '<<Up_b-Low_b+1+cc0+cc1<<endl;
            for(int i=1; i<=n; i++){
              cerr<<vis[i];
            }
            cerr<<endl;
            assert(vis[Low_b]);*/
            ans=max(ans,(r-l+1)*(Up_b-Low_b+1+cc0+cc1));
          }
        }

        del[n+1].clear();
      }
      else{
        //cerr<<"OK";
        for(int i=1; i<=n; i++){
          fa[i]=i;
          sz[i]=1;
          vis[i]=0;
          if(L[i][l]>R[i][l]) continue;
          //assert(L[i][l]==l);
          rec[R[i][l]].emplace_back(i);
        }

        int now=0;
        auto merge=[&](int x,int y)->void{
          if(vis[x]+vis[y]!=2) return ;
          if(get(x)==get(y)) return ;
          sz[get(x)]+=sz[get(y)];
          fa[get(y)]=get(x);
        };

        for(int r=m; r>=l; r--){
          for(auto p:rec[r]){
            vis[p]=1;
            if(p>1) merge(p,p-1);
            if(p<n) merge(p,p+1);
            now=max(now,sz[get(p)]);
          }
          rec[r].clear();
          ans=max(ans,now*(r-l+1));
        }
      }
    }
    if(ans==0) ans=-1;
    cout<<ans<<' ';
    //cerr<<d<<' '<<sum<<endl;
  }
  cout<<'\n';

  return 0;
}