import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N,M,C=map(int,input().split())
graph=[[] for x in range(N)]
for m in range(M):
    u,v,r,w=map(int,input().split())
    u-=1;v-=1
    graph[u].append((v,r,w))
    graph[v].append((u,r,w))
for c in range(1,C+1):
    inf=1<<30
    dist=[-inf]*N
    dist[0]=c
    queue=[(c,0)]
    while queue:
        dx,x=_heappop_max(queue)
        if dist[x]>dx:
            continue
        for y,r,w in graph[x]:
            dy=dx-dx//r-w
            if dist[y]<dy and dy>=0:
                dist[y]=dy
                _heappush_max(queue,(dy,y))
    ans=dist[N-1]
    if ans==-inf:
        ans=-1
    print(ans)