#include<bits/stdc++.h>
using namespace std;
const int N=510,mod=998244353,V=500;
int n,m,lx[N],rx[N],ly[N],ry[N],f[N][N][N<<1];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)scanf("%d%d",&lx[i],&rx[i]);
	for(int i=1;i<=m;i++)scanf("%d%d",&ly[i],&ry[i]);
	f[0][0][V]=1;
	f[0][0][V+1]=-1;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=m;j++){
			for(int k=0;k<=V*2;k++){
				if(k>0)f[i][j][k]=(1ll*f[i][j][k]+f[i][j][k-1])%mod;
				if(k<=V&&i<n){
					if(k+lx[i+1]<=2*V)f[i+1][j][k+lx[i+1]]=(1ll*f[i+1][j][k+lx[i+1]]+f[i][j][k])%mod;
					if(k+rx[i+1]+1<=2*V)f[i+1][j][k+rx[i+1]+1]=(1ll*f[i+1][j][k+rx[i+1]+1]-f[i][j][k]+mod)%mod;
				}else if(k>V&&j<m){
					f[i][j+1][max(0,k-ry[j+1])]=(1ll*f[i][j+1][max(0,k-ry[j+1])]+f[i][j][k])%mod;
					f[i][j+1][max(0,k-ly[j+1]+1)]=(1ll*f[i][j+1][max(0,k-ly[j+1]+1)]-f[i][j][k]+mod)%mod;
				}
			}
		}
	}
	cout<<f[1][1][V-2]<<"\n";
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)cout<<f[i][j][V]<<" ";
		cout<<"\n";
	}
}