1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const ll inf=1ll<<60;
const int N=7010;

int n,k,m;
vector<PII> v[N];
ll f[N],g[N],dis[N];
bool vis[N];
int main() {
	scanf("%d%d%d",&n,&k,&m);
	rep(i,0,n) {
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		v[a].pb(mp(b,c));
	}
	rep(i,0,m) f[i]=inf; f[0]=0;
	rep(i,1,k+1) {
		rep(j,0,m) g[j]=inf;
		for (auto [b,c]:v[i]) {
			rep(j,0,m) g[(j+b)%m]=min(g[(j+b)%m],f[j]+c);
		}
		rep(j,0,m) f[j]=g[j];
	}
	//rep(j,0,m) printf("%lld ",f[j]); puts("");
	rep(i,0,m) dis[i]=inf;
	dis[0]=0;
	rep(i,0,m) {
		ll mv=inf; int md=-1;
		rep(j,0,m) if (!vis[j]&&dis[j]<=mv) {
			mv=dis[j]; md=j;
		}
		vis[md]=1;
		rep(j,0,m) dis[(md+j)%m]=min(dis[(md+j)%m],dis[md]+f[j]);
	}
	rep(j,0,m) {
		if (dis[j]>=inf) dis[j]=-1;
		printf("%lld\n",dis[j]);
	}

}