#include <bits/stdc++.h>
//#include <atcoder/modint>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
#define rep(i,n) for(long long i=0;i<n;i++)
#define rep1(i,n) for(long long i=1;i<=n;i++)
#define Rep(i,a,b) for(long long i=a;i<=b;i++)
#define all(a) (a).begin(), (a).end()
#define fst first
#define snd second
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> vvec;
typedef vector<long long> vecll;
typedef vector<vector<long long>> vvecll;

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

const ll mod=998244353;

class mint {
public:
    long long x;
    constexpr mint(long long x=0) : x((x%mod+mod)%mod) {}
    constexpr mint operator-() const { 
      return mint(-x);
    }
    constexpr mint& operator+=(const mint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    constexpr mint& operator-=(const mint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    constexpr mint& operator*=(const mint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    constexpr mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    constexpr mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    constexpr mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    constexpr mint pow(long long t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime mod
    constexpr mint inv() const {
        return pow(mod-2);
    }
    constexpr mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    constexpr mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
};
ostream& operator<<(ostream& os, const mint& m){
    os << m.x;
    return os;
}


//xのn乗をpで割ったあまりを求める
ll modpow(ll x,ll n,ll p=mod){
  if(n==0) return 1;
  if(n%2==1) return (x*modpow(x,n-1,p))%p;
  else{
    ll t=modpow(x,n/2,p);
    assert(t>0);
    return (t*t)%p;
  }
}

//xの逆元(p:素数)
ll inv(ll x,ll p=mod){
  return modpow(x,p-2,p);
}

template <typename T>
int index(vector<T> &a, T x){
	return lower_bound(all(a),x)-a.begin();
}

long long modulo(long long a, long long m) {
    return (a % m + m) % m;
}

const ll mod2=1000000009;

const ll INF=5e18;
const int INT_INF=1e9;
const double pi=3.14159265358979;

struct NTT{

  ll mod,prim;
  vector<ll> root,invroot;

  //xのn乗をpで割ったあまりを求める
  ll modpow(ll x,ll n,ll p){
    if(n==0) return 1;
    if(n%2==1) return (x*modpow(x,n-1,p))%p;
    else{
      ll t=modpow(x,n/2,p);
      assert(t>0);
      return (t*t)%p;
    }
  }

  //xの逆元(p:素数)
  ll inv(ll x,ll p){
    return modpow(x,p-2,p);
  }

  NTT(ll mod,ll prim) : mod(mod),prim(prim) {
    ll cnt=0;
    ll p=mod-1;
    while(p%2==0){
      p/=2;
      cnt++;
    }

    ll r=modpow(prim,p,mod);
    for(ll i=0;i<cnt;i++){
      root.push_back(r);
      r=(r*r)%mod;
    }
    reverse(root.begin(),root.end());

    for(ll i=0;i<cnt;i++){
      invroot.push_back(inv(root[i],mod));
    }
  }

  vector<ll> ntt(vector<ll> a, bool in){
    ll n=a.size();
    for (int i = 0, j = 1; j < n - 1; j++) {
      for (int k = n / 2; k > (i ^= k); k /= 2);
      if (i > j) swap(a[i], a[j]);
    }

    for(int logi=0,i=1;i<n;i*=2,logi++){

      ll base=(!in?root[logi]:invroot[logi]);
      vector<ll> w(i+1);
      w[0]=1;
      for(int j=0;j<i;j++){
        w[j+1]=(w[j]*base)%mod;
      }
      for(int j=0;j<n;j+=2*i){
        for(int k=0;k<i;k++){
          ll u=a[j+k];
          ll v=(a[j+k+i]*w[k])%mod;
          a[j+k]=(u+v)%mod;
          a[j+k+i]=(u-v+mod)%mod;
        }
      }
    }
    
    if(in){
      ll inv_n=inv(n,mod);
      for(int i=0;i<n;i++){
        a[i]=(a[i]*inv_n)%mod;
      }
    }

    return a;
  }

  vector<ll> convolution(vector<ll> a, vector<ll> b){
    int la=a.size(),lb=b.size();
    int lc=la+lb-1;

    ll n=1;
    while(n<=lc) n*=2;

    while(a.size()<n) a.push_back(0LL);
    while(b.size()<n) b.push_back(0LL);

    vector<ll> da=ntt(a,false);
    vector<ll> db=ntt(b,false);

    vector<ll> dc(n);
    for(ll i=0;i<n;i++){
      dc[i]=(da[i]*db[i])%mod;
    }

    vector<ll> c=ntt(dc,true);

    return c;

  }
};

//ax+by=gcd(a,b)の解を1つ求める
ll exgcd(ll a,ll b,ll &x,ll &y){
  if(b==0){
    x=1;
    y=0;
    return a;
  }
  ll d=exgcd(b,a%b,y,x);
  y-=a/b*x;
  return d;
}

ll ChineseRem(ll b1, ll m1, ll b2, ll m2){
  ll p,q;
  ll d=exgcd(m1,m2,p,q);
  if((b1-b2)%d!=0) return -1;
  ll m=m1*(m2/d);
  ll tmp=((b2-b1)/d*p)%(m2/d);
  ll r=modulo(b1+m1*tmp,m);
  return r;
}


int main(){
	int n,m;
  cin >> n >> m;
  vecll a(n),b(m);
  rep(i,n){
    cin >> a[i];
    a[i]/=100;
  }
  rep(i,m){
    cin >> b[i];
    b[i]=100-b[i];
  }
  while(a.size()>b.size()) b.push_back(100);
  sort(all(a));
  sort(all(b));
  
  NTT ntt(998244353,3),ntt2(897581057,3);
  vecll c=ntt.convolution(a,b),d=ntt2.convolution(a,b);
  vecll ans;
  rep(i,n){
    ans.push_back(ChineseRem(c[i],998244353,d[i],897581057));
  }
  rep(i,n) cout << ans[i] << endl;
  

	return 0;
}