/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 1e4 + 5;
int n, m, h;
vector<pii> adj[MAXN];
void init() {
cin >> n >> m >> h;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < h; ++j) {
int v, w; cin >> v >> w;
v += 1;
if (i >= v) continue;
// cout << i << ' ' << v << ' ' << w << '\n';
adj[i].push_back({v, w});
}
}
}
const ll CAP = 500000001;
ll dp[MAXN][405];
void solve() {
dp[1][0] = 1;
for (int i = 1; i < n; ++i) {
for (int used = 0; used < m; ++used) {
for (auto &e : adj[i]) {
int j = e.fi, k = e.se;
if (used + k < m)
dp[j][used + k] += dp[i][used];
}
}
for (int used = 1; used < m; ++used)
dp[i + 1][used] += dp[i + 1][used - 1];
for (int used = 1; used < m; ++used)
if (dp[i + 1][used] > CAP)
dp[i + 1][used] = CAP;
}
for (int used = 0; used < m; ++used)
cout << dp[n][used] << ' ';
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
