import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.Closeable;
import java.io.IOException;
import java.util.NoSuchElementException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author HBonsai
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ShortestPathNegative solver = new ShortestPathNegative();
        solver.solve(1, in, out);
        out.close();
    }

    static class ShortestPathNegative {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int V = in.nextInt();
            int E = in.nextInt();
            int r = in.nextInt();
            int[] dis = new int[V];
            final int INF = Integer.MAX_VALUE; // ここでINFをMAXにしないとWA
            Arrays.fill(dis, INF);
            dis[r] = 0;
            Edge[] edges = new Edge[E];
            Arrays.setAll(edges, i -> new Edge(in.nextInt(), in.nextInt(), in.nextInt()));
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < E; j++) {
                    Edge e = edges[j];
                    if (dis[e.from] != INF && dis[e.to] > dis[e.from] + e.cost) {
                        dis[e.to] = dis[e.from] + e.cost;
                        if (i == V - 1) {
                            out.println("NEGATIVE CYCLE");
                            return;
                        }
                    }
                }
            }
            for (int i = 0; i < V; i++) {
                if (dis[i] == INF) out.println("INF");
                else out.println(dis[i]);
            }
        }

        class Edge {
            public int from;
            public int to;
            public int cost;

            public Edge(int from, int end, int cost) {
                this.from = from;
                this.to = end;
                this.cost = cost;
            }

        }

    }

    static class FastScanner implements Closeable {
        private final InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        public FastScanner(InputStream in) {
            this.in = in;
        }

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }

        private int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
            return hasNextByte();
        }

        public long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public void close() {
            try {
                in.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

    }
}




Measured memory_bytes: 31272