#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, m;
  cin >> n >> m;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  sort(a.begin(), a.end());
  vector<ll> cnt(100, 0), idx(100, 0);
  cnt[0] = n;
  rep(i, m) {
    ll b;
    cin >> b;
    cnt[b]++;
  }
  ll ans = 0;
  rep(i, n) {
    ans += a[i] / 100;
    idx[99]++;
    for (ll j = 99; j >= 1; j--) {
      if (idx[j] - idx[j - 1] <= cnt[j])
        break;
      ans -= a[idx[j - 1]] / 100 * (100 - j);
      ans += a[idx[j - 1]] / 100 * (100 - (j - 1));
      idx[j - 1]++;
    }
    cout << ans << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}