#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
mt19937 gnd(time(NULL));
void solve(){
int n, m, k;
cin >> n >> m >> k;
int dp[n+7][m+4];
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
dp[i][j]=0;
}
}
// cout << "st" << endl;
vector<vector<pair<int, int>>> v(n+4, vector<pair<int,int>> (k+3));
for(int i = 0; i < n-1; i++){
for(int j = 0; j < k; j++){
cin >> v[i][j].f >> v[i][j].s;
}
}
dp[0][0]=1;
// cout << "med" << endl;
for(int i = 0; i < n-1; i++){
for(int j = 0; j <= m; j++){
if(j > 0) dp[i][j]=min((int) 5e8+1, dp[i][j]+dp[i][j-1]);
for(int kk = 0; kk < k; kk++){
if(j+v[i][kk].second <= m){
cout << i << " " << j << " " << kk << endl;
dp[v[i][kk].first][j+v[i][kk].second] = min((int) 5e8+1, dp[v[i][kk].first][j+v[i][kk].second]+dp[i][j]);
}
}
}
}
for(int j = 0; j < m; j++){
cout << dp[n-1][j] << " ";
}
cout << endl;
}
signed main(){
int t = 1;
// cin >> t;
while(t--) solve();
}
