#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 1e6 + 5;
int n, w;
int l[mx];
vector<int> arr[mx];
vector<pair<int, int> > add_element[mx], rem_element[mx];
multiset<pair<int, int> > st[mx];
long long ans[2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> w;
  for (int i = 0; i < n; ++i) {
    cin >> l[i];
    arr[i].resize(l[i]);
    for (int j = 0; j < l[i]; ++j) {
      cin >> arr[i][j];
      add_element[j + 1].emplace_back(make_pair(arr[i][j], i));
      rem_element[w - l[i] + j + 1].emplace_back(make_pair(arr[i][j], i));
    }
    if (l[i] < w) {
      add_element[1].emplace_back(make_pair(0, i));
      rem_element[w - l[i]].emplace_back(make_pair(0, i));
      add_element[1 + l[i]].emplace_back(make_pair(0, i));
    }
  }
  for (int i = 1; i <= w; ++i) {
    for (pair<int, int> x : add_element[i]) {
      if (!st[x.second].empty()) ans[i % 2] -= (*st[x.second].rbegin()).first;
      st[x.second].insert(x);
      ans[i % 2] += (*st[x.second].rbegin()).first;
    }
    ans[(i + 1) % 2] = ans[i % 2];
    for (pair<int, int> x : rem_element[i]) {
      if (!st[x.second].empty())
        ans[(i + 1) % 2] -= (*st[x.second].rbegin()).first;
      st[x.second].erase(st[x.second].find(x));
      if (!st[x.second].empty())
        ans[(i + 1) % 2] += (*st[x.second].rbegin()).first;
    }
    cout << ans[i % 2] << " ";
  }
}
