// 既出判定士1級です
// https://atcoder.jp/contests/kupc2016/tasks/kupc2016_h
#include<bits/stdc++.h>

using namespace std;
using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int64 solve(vector< int64 > A, vector< int64 > B, vector< int64 > xs) {
  int N = (int) A.size();
  int64 sumall = 0;
  for(int i = 0; i < N; i++) {
    sumall += A[i];
    sumall -= B[i];
  }
  priority_queue< pair< int64, int64 > > que;
  int64 sum = 0, ans = 0;
  for(int i = 0; i < N; i++) {

    {
      sum += A[i] - B[i];
      int64 cur = sumall - sum;
      ans += abs(cur);
      if(cur <= 0) {
        que.emplace(0, 1);
        goto foo;
      }
      if(cur > sumall) {
        cur = sumall;
      }
      que.emplace(-cur, 2);
      auto[cost, d] = que.top();
      que.pop();
      ans += cost;
      d -= 1;
      if(d != 0) {
        que.emplace(cost, d);
      }
    }

    foo:;


    if(i + 1 < N) {
      int64 d = xs[i + 1] - xs[i] - 1;
      int64 cur = sumall - sum;
      if(d) {
        ans += d * abs(cur);
        if(cur <= 0) {
          que.emplace(0, d);
          continue;
        }
        if(cur > sumall) {
          cur = sumall;
        }
        que.emplace(-cur, 2 * d);
        while(d > 0) {
          auto[cost, e] = que.top();
          que.pop();
          int64 p = min(d, e);
          ans += cost * p;
          e -= p;
          d -= p;
          if(e != 0) {
            que.emplace(cost, e);
          }
        }
      }
    }
  }
  return ans;
}

int main() {
  int N, M;
  cin >> M >> N;
  vector< int64 > A(M), B(N);
  cin >> A >> B;

  vector< int64 > C{A};
  for(auto &b : B) C.emplace_back(b);
  sort(begin(C), end(C));
  C.erase(unique(begin(C), end(C)), end(C));
  sort(begin(C), end(C));
  C.erase(unique(begin(C), end(C)), end(C));


  for(auto &a : A) a = lower_bound(begin(C), end(C), a) - begin(C);
  for(auto &a : B) a = lower_bound(begin(C), end(C), a) - begin(C);
  vector< int64 > as(C.size()), bs(C.size());
  for(auto &a : A) bs[a]++;
  for(int k = 1; k <= M; k++) {
    for(auto &a : B) as[a]++;
    cout << solve(as, bs, C) << "\n";
  }
}