
import collection.mutable.ArrayBuffer
import scala.reflect.ClassTag
import scala.language.implicitConversions

trait Graph { 
    case class Edge[T:Numeric](from : Int, to : Int, cost : T)

    class Edges[T:Numeric](val data : ArrayBuffer[Edge[T]]) {
        def size = data.size
    }
    object Edges {
        def apply[T:Numeric](xs : Edge[T]*) = new Edges(ArrayBuffer(xs:_*))
        implicit def toUnderLying[T](x:Edges[T]) = x.data
    }

    class WeightedGraph[T:Numeric](val size : Int, val data : Array[Edges[T]]) {
        def this(size : Int) = this(size, Array.fill(size)(Edges()))
    }
    object WeightedGraph {
        def apply[T:Numeric](size : Int) = new WeightedGraph[T](size)
        implicit def toUnderLying[T](x:WeightedGraph[T]) = x.data
    }

    class UnWeightedGraph[T:Numeric](val size : Int, val data: Array[ArrayBuffer[T]]) {
        def this(size : Int) = this(size, Array.fill(size)(ArrayBuffer[T]()))
    }
    object UnWeightedGraph {
        def apply[T:Numeric](size : Int) = new UnWeightedGraph[T](size)
        implicit def toUnderLying[T](x:UnWeightedGraph[T]) = x.data
    }
   
    class Matrix[T:Numeric:ClassTag](val row : Int, val col : Int, val data : Array[Array[T]]) {
        def this(row : Int, col : Int) = this(row, col, Array.fill(row, col)(implicitly[Numeric[T]].zero))
        def this(size : Int) = this(size, size)
    }
    object Matrix {
        implicit def toUnderLying[T](x:Matrix[T]) = x.data
    }
}
import scala.collection.mutable.PriorityQueue

object Dijkstra extends Graph {
    def dijkstra[T:ClassTag](g : WeightedGraph[T], s : Int, INF : T)(implicit num : Numeric[T]) : Array[T] = {
        import num._
        val dist = Array.fill(g.size)(INF)
        dist(s) = zero
        // (shortest path candidate, vertex)
        val que = PriorityQueue()(Ordering.Tuple2[T, Int].reverse)
        que += ((zero, s))
        while(!que.isEmpty) {
            val (d, v) = que.dequeue
            if (dist(v) >= d) {
                for (e <- g(v)) {
                    val cost = dist(v) + e.cost
                    if (dist(e.to) > cost) {
                        dist(e.to) = cost
                        que += ((cost, e.to))
                    }
                }
            }
        }
        dist
    }
}

// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A
import Dijkstra._

object Main {
    def main(args: Array[String]) = {
        val sc = new java.util.Scanner(System.in)
        val V, E, r = sc.nextInt
        val edges = WeightedGraph[Int](V)
        for (_ <- 1 to E) {
            val s, t, c = sc.nextInt
            edges(s) += Edge(s, t, c)
        }
        val res = dijkstra(edges, r, Int.MaxValue)
        if (res.isEmpty) println("NEGATIVE CYCLE")
        else {
            for (d <- res)
            if (d == Int.MaxValue) println("INF")
            else println(d)
        }
    }
}
