#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = 4 * 1e18;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

//atcoder
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

int main()
{
    ////////////////////
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    ////////////////////

    ll N, M;
    cin >> N >> M;
    vector<ll> A(N), B(M), C(N);
    rep(i, 0, N) {
        cin >> A.at(i);
    }
    sort(A.begin(), A.end());
    rep(i, 0, M) {
        cin >> B.at(i);
        B.at(i)=100-B.at(i);
    }
    sort(B.begin(), B.end());
    rep(i, 0, min(N, M)) {
        C.at(i)=B.at(i);
    }
    rep(i, min(N, M), N) {
        C.at(i)=100;
    }
    vector<ll> ans=convolution_ll(A, C);
    rep(i, 0, N) {
        cout << ans.at(i)/100 << endl;
    }
}