#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, f;
  cin >> n >> f;
  VI a(n), b(n), c(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  rep(i, n) cin >> c[i];
  int mx = n * f + 61;
  vector<char> visited(mx);
  VL added(mx);
  int ans = 0;
  VI todo[61];
  auto add = [&](int x) {
    if (visited[x]) return;
    visited[x] = true;
    ans++;
    for (int i = 1; i <= f; i++) if (!visited[x+i] && ~added[x+i] >> i & 1) {
      added[x+i] |= 1LL << i;
      todo[i].emplace_back(x+i);
    }
  };
  add(0);
  rep(i, n) {
    int d[3]{a[i], b[i], c[i]};
    ranges::sort(d);
    int ai = d[1] - d[0], bi = d[2] - d[0];
    static VI vs;
    vs.clear();
    vs.insert(vs.end(), all(todo[ai]));
    todo[ai].clear();
    vs.insert(vs.end(), all(todo[bi]));
    todo[bi].clear();
    for (int v : vs) add(v);
    cout << ans << '\n';
  }
}