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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int V, E, r;

        void solve(InputReader in, PrintWriter out) {
            V = in.nextInt();
            E = in.nextInt();
            r = in.nextInt();

            BellmanFord bf = new BellmanFord(V);

            for (int i = 0; i < E; ++i) {
                int u = in.nextInt();
                int v = in.nextInt();
                int w = in.nextInt();
                bf.addEdge(u, v, w);
            }

            bf.setDistances(r);

            if (bf.hasNegativeCycle()) {
                out.println("NEGATIVE CYCLE");
                return;
            }

            for (int i = 0; i < V; ++i) {
                int d = bf.getDistance(i);
                out.println(d == Integer.MAX_VALUE ? "INF" : d);
            }
        }
    }

    static class BellmanFord {
        private static int INF = Integer.MAX_VALUE;

        private int[] dst;
        private List<Edge> edges;

        private class Edge {
            int src;
            int dest;
            int weight;

            Edge(int s, int d, int w) {
                this.src = s;
                this.dest = d;
                this.weight = w;
            }
        }

        public BellmanFord(int n) {
            this.dst = new int[n];
            this.edges = new ArrayList<>();
        }

        public boolean hasNegativeCycle() {
            for (Edge e : edges) {
                int u = e.src;
                int v = e.dest;
                int w = e.weight;

                if (dst[u] != INF && dst[u] + w < dst[v]) {
                    return true;
                }
            }
            return false;
        }

        public int getDistance(int node) {
            return dst[node];
        }

        public void setDistances(int sp) {
            Arrays.fill(dst, INF);
            dst[sp] = 0;

            for (int i = 0; i < dst.length; ++i) {
                for (Edge e : edges) {
                    int u = e.src;
                    int v = e.dest;
                    int w = e.weight;

                    if (dst[u] != INF && dst[u] + w < dst[v]) {
                        dst[v] = dst[u] + w;
                    }
                }
            }
        }

        public void addEdge(int u, int v, int w) {
            edges.add(new Edge(u, v, w));
        }
    }

    static class InputReader {
        static int BUFSIZE = 32768;

        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), BUFSIZE);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; ++i) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; ++i) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
}

