#include<bits/stdc++.h>
using namespace std;
inline int max(int a,int b){return a>b?a:b;}
inline int read(){
  register int x=0,f=1;
  char c=getchar();
  while(c<'0' || '9'<c) f=(c=='-')?-1:1,c=getchar();
  while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0',c=getchar();
  return x*f;
}
const int N=510,mod=998244353;
int n,m,xl[N],xr[N],yl[N],yr[N],f[N][N][2*N],dx[N][2],dy[N][2];
bool able[N][N];
int main()
{
  //freopen("test1.in","r",stdin);
  n=read(),m=read();
  for(int i=1;i<=n;i++) xl[i]=read(),xr[i]=read(),dx[i][1]=dx[i-1][1]+xr[i],dx[i][0]=dx[i-1][0]+xl[i];
  for(int i=1;i<=m;i++) yl[i]=read(),yr[i]=read(),dy[i][1]=dy[i-1][1]+yr[i],dy[i][0]=dy[i-1][0]+yl[i];
  for(int i=xl[1];i<=xr[1];i++)
    for(int j=yl[1];j<=yr[1];j++)
      f[1][1][i-j+500]++;
  able[1][1]=true;
  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++){
      if(!able[i][j]) continue;
      for(int k=0;k<=1000;k++){
        if(f[i][j][k]==0) continue;
        if(k<=500){
          for(int l=xl[i+1];l<=xr[i+1];l++)
            f[i+1][j][k+l]=(f[i+1][j][k+l]+f[i][j][k])%mod;
          able[i+1][j]=true;
        }
        else{
          for(int l=yl[j+1];l<=yr[j+1];l++)
            f[i][j+1][k-l]=(f[i][j+1][k-l]+f[i][j][k])%mod;
          able[i][j+1]=true;
        }
      }
    }
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++)
      printf("%d ",f[i][j][500]);
    putchar('\n');
  }
  return 0;  
}