import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
2 1 1
1 2 1 1
2 1 3
1 2 2 1
4 4 5
1 2 3 2
1 3 2 1
2 4 3 1
3 4 2 1
"""

inf=10**20
def Dijkstra(G,s,c):
  done=[0]*len(G)
  C=[inf]*len(G)
  C[s]=-c
  h=[]
  heappush(h,(-c,s))
  while h:
    x,y=heappop(h)
    if done[y]:
      continue
    done[y]=1
    for r,w,v in G[y]:
      if C[v]>x+(-x)//r+w and x+(-x)//r+w<=0:
        C[v]=x+(-x)//r+w
        heappush(h,(C[v],v))
  return C

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M,C=map(int, input().split())
  G=[[] for _ in range(N)]
  for _ in range(M):
    i,j,r,w=map(int, input().split())
    G[i-1].append((r,w,j-1))
    G[j-1].append((r,w,i-1))
  ans=[]
  for c in range(C):
    D=Dijkstra(G,0,c+1)[N-1]
    ans.append(-D if D!=inf else -1)
    # print(c,Dijkstra(G,0,c))
  print(*ans,sep='\n')

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)