Constraints

* 1 ≤ |V| ≤ 1000
* 0 ≤ |E| ≤ 2000
* -10000 ≤ di ≤ 10000
* There are no parallel edges
* There are no self-loops

Input

An edge-weighted graph G (V, E) and the source r.


|V| |E| r
s0 t0 d0
s1 t1 d1
:
s|E|-1 t|E|-1 d|E|-1


|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.

si and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.

Output

If the graph contains a negative cycle (a cycle whose sum of edge costs is a negative value) which is reachable from the source r, print


NEGATIVE CYCLE


in a line.

Otherwise, print


c0
c1
:
c|V|-1


The output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print "INF".

Examples

Input

4 5 0
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2


Output

0
2
-3
-1


Input

4 6 0
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2
3 1 0


Output

NEGATIVE CYCLE


Input

4 5 1
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2


Output

INF
0
-5
-3
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            solve(in);
        }
    }

    private static void solve(Scanner in) {
        int V = in.nextInt(), E = in.nextInt(), r = in.nextInt();
        EdgeWeightedGraph G = new EdgeWeightedGraph(V);
        for (int i = 0; i < E; i++) {
            G.addEdge(new DEdge(in.nextInt(), in.nextInt(), in.nextInt()));
        }
        BellmanFord bellman = new BellmanFord(G, r);
        if (bellman.hasNegativeCycle()) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int v = 0; v < G.V(); v++) {
                System.out.println(bellman.distTo(v));
            }
        }
    }
}

class BellmanFord {
    private static final double PINF = Double.POSITIVE_INFINITY;
    private static final double NINF = Double.NEGATIVE_INFINITY;

    private final double[] distTo;
    private boolean hasNegativeCycle;

    BellmanFord(EdgeWeightedGraph G, int r) {
        distTo = new double[G.V()];
        for (int v = 0; v < distTo.length; v++) {
            distTo[v] = v == r ? 0 : PINF;
        }
        for (int i = 0; i < G.V() - 1; i++) {
            for (DEdge e : G.edges()) {
                if (distTo[e.v] > distTo[e.u] + e.weight) {
                    distTo[e.v] = distTo[e.u] + e.weight;
                }
            }
        }
        for (DEdge e : G.edges()) {
            if (distTo[e.v] > distTo[e.u] + e.weight) {
                distTo[e.v] = NINF;
                hasNegativeCycle = true;
            }
        }
    }

    boolean hasNegativeCycle() {
        return hasNegativeCycle;
    }

    String distTo(int u) {
        return distTo[u] == PINF ? "INF" : String.valueOf((int) distTo[u]);
    }
}

class EdgeWeightedGraph {
    private final List<DEdge>[] adj;
    private int E;

    @SuppressWarnings("unchecked")
    EdgeWeightedGraph(int V) {
        adj = new List[V];
        for (int v = 0; v < adj.length; v++) {
            adj[v] = new ArrayList<>();
        }
    }

    int V() {
        return adj.length;
    }

    int E() {
        return E;
    }

    void addEdge(DEdge e) {
        adj[e.u].add(e);
        E++;
    }

    Iterable<DEdge> adj(int u) {
        return adj[u];
    }

    Iterable<DEdge> edges() {
        List<DEdge> edges = new ArrayList<>(E());
        for (int v = 0; v < V(); v++) {
            for (DEdge e : adj(v)) {
                edges.add(e);
            }
        }
        return edges;
    }
}

class DEdge {
    final int u, v, weight;

    DEdge(int u, int v, int weight) {
        this.u = u;
        this.v = v;
        this.weight = weight;
    }

    @Override
    public String toString() {
        return String.format("%d->%d(%d)", u, v, weight);
    }
}