Constraints

* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 9900
* -2 × 107 ≤ di ≤ 2 × 107
* There are no parallel edges
* There are no self-loops

Input

An edge-weighted graph G (V, E).


|V| |E|
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.

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), print


NEGATIVE CYCLE


in a line.

Otherwise, print


D0,0 D0,1 ... D0,|V|-1
D1,0 D1,1 ... D1,|V|-1
:
D|V|-1,0 D1,1 ... D|V|-1,|V|-1


The output consists of |V| lines. For each ith line, print the cost of the shortest path from vertex i to each vertex j (j = 0, 1, ... |V|-1) respectively. If there is no path from vertex i to vertex j, print "INF". Print a space between the costs.

Examples

Input

4 6
0 1 1
0 2 5
1 2 2
1 3 4
2 3 1
3 2 7


Output

0 1 3 4
INF 0 2 3
INF INF 0 1
INF INF 7 0


Input

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


Output

0 1 -5 -4
INF 0 2 3
INF INF 0 1
INF INF 7 0


Input

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


Output

NEGATIVE CYCLE
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.math.BigInteger;
 
public class Main implements Runnable {
	
	static int mod = 1000000007;
    static boolean[] s;
	
    public static void main(String[] args) {
    	new Thread(null, new Main(), "", 1024 * 1024 * 1024).start();
    }
    
    public void run() {
       	PrintWriter out = new PrintWriter(System.out);
        FastScanner sc = new FastScanner();
        
        int v = sc.nextInt();
        int e = sc.nextInt();
        WDGraph g = new WDGraph(v);
         
        for(int i=0;i<e;i++){
            g.addEdge(sc.nextInt(), sc.nextInt(), sc.nextInt());
        }
 
        long[][] a = g.WarshallFloyd();
        boolean isN = false;
         
        for(int i=0;i<v;i++){
            if(a[i][i]<0){
                out.println("NEGATIVE CYCLE");
                isN = true;
                break;
            }
        }
         
        if(!isN){
            for(int i=0;i<v;i++){
                for(int j=0;j<v-1;j++){
                    if(a[i][j]==Long.MAX_VALUE){
                        out.print("INF" + " ");
                    }
                    else{
                        out.print(a[i][j] + " ");
                    }
                }
                if(a[i][v-1]==Long.MAX_VALUE){
                    out.print("INF");
                }
                else{
                	out.print(a[i][v-1]);
                }
                out.println();
            }
        }
        
        out.flush();
    }

}

class WDGraph {
	public WEdgeList[] elist;
	
	public WDGraph(int vnum){
		this.elist = new WEdgeList[vnum];
		for(int i=0;i<vnum;i++){
			elist[i] = new WEdgeList();
		}
	}
	
	//同じ辺を複数回追加すると多重辺が生まれてしまう
	public void addEdge(int from, int to, int w){
		elist[from].add(new WEdge(to,w));
	}
	
	//頂点数を返す
	public int vnum(){
		return elist.length;
	}
	
	//自身から伸びる全ての辺を返す
	public WEdgeList EList(int n){
		return elist[n];
	}
	
	//ダイクストラ法でsからの最短距離列を求める。到達不可はMAXVALUE。
	public long Dijkstra(int start, int goal){
		
		PriorityQueue<NextNode> frontier = new PriorityQueue<>((x,y)->Long.compare(x.g, y.g));
		boolean[] isExplored = new boolean[vnum()];
		long[] g = new long[vnum()];
		Arrays.fill(g, Long.MAX_VALUE);
		
		g[start] = 0;
		frontier.add(new NextNode(start,0));
		
		while(!frontier.isEmpty()){
			NextNode now = frontier.poll();
			if(now.i == goal){
				return g[now.i];
			}
			
			if(!isExplored[now.i]){
				isExplored[now.i] = true;
				
				for(WEdge e:EList(now.i)){
					if(isExplored[e.to]){
						continue;
					}
					
					int next = e.to;
					if(g[next] <= g[now.i] + e.w){
						continue;
					}
					
					g[next] = now.g + e.w;
					frontier.add(new NextNode(next,g[next]));
				}	
			}
		}
		
		return -1;
	}
	//ダイクストラ法でsからの最短距離列を求める。到達不可はMAXVALUE。
	public long[] DijkstraArray(int start){
		
		PriorityQueue<NextNode> frontier = new PriorityQueue<>((x,y)->Long.compare(x.g, y.g));
		boolean[] isExplored = new boolean[vnum()];
		long[] g = new long[vnum()];
		Arrays.fill(g, Long.MAX_VALUE);
		
		g[start] = 0;
		frontier.add(new NextNode(start,0));
		
		while(!frontier.isEmpty()){
			NextNode now = frontier.poll();
			
			if(!isExplored[now.i]){
				isExplored[now.i] = true;
				
				for(WEdge e:EList(now.i)){
					if(isExplored[e.to]){
						continue;
					}
					
					int next = e.to;
					if(g[next] <= g[now.i] + e.w){
						continue;
					}
					
					g[next] = now.g + e.w;
					frontier.add(new NextNode(next,g[next]));
				}	
			}
		}
		
		return g;
	}
	class NextNode{
		int i;
		long g;
		public NextNode(int i, long g){
			this.i=i;
			this.g=g;
		}
	}
	
	//ベルマンフォード法でsからの最短距離列を求める。到達不可はMAX_VALUE。sから到達可能な負閉路があれば-1の列を返す。
	//負辺がないならダイクストラの方が速い。
	public long[] BellmanFord(int start){
		long[] d = new long[vnum()];
		Arrays.fill(d,Long.MAX_VALUE);
		d[start] = 0;
		
		for(int p=0;p<vnum()-1;p++){
			for(int i=0;i<vnum();i++){
				for(WEdge e:elist[i]){
					if(d[i] != Long.MAX_VALUE){
						d[e.to] = Math.min(d[e.to],d[i]+e.w);
					}
				}
			}
		}
		
		//V回目のループで更新が起きるなら負閉路が存在
		for(int i=0;i<vnum();i++){
			for(WEdge e:elist[i]){
				if(d[i] != Long.MAX_VALUE){
					if(d[e.to] > d[i] + e.w){
						Arrays.fill(d,Long.MIN_VALUE);
					}
				}
			}
		}
		
		return d;
	}
	
	//全点対最短距離をワーシャルフロイド法で求める（自身への距離が負になる要素を持つ⇔負閉路を持つ）
	public long[][] WarshallFloyd(){
		long[][][] d = new long[vnum()+1][vnum()][vnum()]; //頂点0～k-1とi,jのみを使うiからjへの最短路
		
		for(int k=0;k<vnum()+1;k++){
			for(int i=0;i<vnum();i++){
				Arrays.fill(d[k][i], Long.MAX_VALUE);
				d[k][i][i] = 0;
			}
		}

		for(int i=0;i<vnum();i++){
			for(WEdge e:elist[i]){
				d[0][i][e.to] = e.w;
			}
		}
		
		for(int k=1;k<vnum()+1;k++){
			for(int i=0;i<vnum();i++){
				for(int j=0;j<vnum();j++){
					if((d[k-1][i][k-1] != Long.MAX_VALUE) && (d[k-1][k-1][j] != Long.MAX_VALUE)){
						d[k][i][j] = Math.min(d[k-1][i][j], d[k-1][i][k-1] + d[k-1][k-1][j]);
					}
					else{
						d[k][i][j] = d[k-1][i][j];
					}
				}
			}
		}
		
		return d[vnum()];
	}
	
	public class WEdgeList extends ArrayList<WEdge>{
		private static final long serialVersionUID = -3222721656143220018L;
	}
	public class WEdge{
		public int to;
		public int w;
		
		public WEdge(int to, int w){
			this.to = to;
			this.w = w;
		}
	}

}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	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 String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	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 int[] nextintArray(int n){
		int[] a = new int[n];
		for(int i=0;i<n;i++){
			a[i] = nextInt();
		}
		return a;
	}
	public long[] nextlongArray(int n){
		long[] a = new long[n];
		for(int i=0;i<n;i++){
			a[i] = nextLong();
		}
		return a;
	}
	public Integer[] nextIntegerArray(int n){
		Integer[] a = new Integer[n];
		for(int i=0;i<n;i++){
			a[i] = nextInt();
		}
		return a;
	}
	public int[][] nextintMatrix(int h, int w){
		int[][] mat = new int[h][w];
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				mat[i][j] = nextInt();
			}
		}
		return mat;
	}
	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
