#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
int n, w;
long long sms[1000005];
long long ans[1000005];
vector<pair<long long, long long> > tab[1000005];
void upd(int l, int r, int v) {
  sms[l] += v;
  sms[r + 1] -= v;
}
void rec() {
  ans[0] = sms[0];
  for (int i = (1); i <= (signed)(w); i++) {
    ans[i] = ans[i - 1] + sms[i];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> w;
  for (int i = 0; i < (signed)(n); i++) {
    int l;
    cin >> l;
    tab[i].resize(l + 1);
    for (int j = 0; j < (signed)(l); j++) {
      cin >> tab[i][j].first;
      tab[i][j].second = j + 1;
    }
    tab[i][l] = {0, -1};
    sort(tab[i].begin(), tab[i].end(), greater<pair<long long, long long> >());
    set<int> hmm;
    for (int j = 0; j < (signed)(l + 1); j++) {
      int loc = tab[i][j].second;
      long long val = tab[i][j].first;
      if (loc == -1) {
        hmm.insert(0);
        hmm.insert(l + 1);
        continue;
      }
      set<int>::iterator ab = hmm.lower_bound(loc);
      int top;
      if (ab == hmm.end())
        top = w;
      else
        top = *ab - 1;
      int bot;
      if (ab == hmm.begin())
        bot = 1;
      else
        bot = w - l + *(--ab) + 1;
      if (top < bot) continue;
      int rt = min(top, w - l + loc);
      int lt = max(bot, loc);
      upd(lt, rt, val);
      hmm.insert(loc);
    }
  }
  rec();
  for (int i = (1); i <= (signed)(w); i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
