Problem: A famous sculptor Cicasso goes to a world tour!

Well, it is not actually a world-wide. But not everyone should have the opportunity to see works of sculptor, shouldn't he? Otherwise there will be no any exclusivity. So Cicasso will entirely hold the world tour in his native country — Berland.

Cicasso is very devoted to his work and he wants to be distracted as little as possible. Therefore he will visit only four cities. These cities will be different, so no one could think that he has "favourites". Of course, to save money, he will chose the shortest paths between these cities. But as you have probably guessed, Cicasso is a weird person. Although he doesn't like to organize exhibitions, he likes to travel around the country and enjoy its scenery. So he wants the total distance which he will travel to be as large as possible. However, the sculptor is bad in planning, so he asks you for help. 

There are n cities and m one-way roads in Berland. You have to choose four different cities, which Cicasso will visit and also determine the order in which he will visit them. So that the total distance he will travel, if he visits cities in your order, starting from the first city in your list, and ending in the last, choosing each time the shortest route between a pair of cities — will be the largest. 

Note that intermediate routes may pass through the cities, which are assigned to the tour, as well as pass twice through the same city. For example, the tour can look like that: <image>. Four cities in the order of visiting marked as overlines: [1, 5, 2, 4].

Note that Berland is a high-tech country. So using nanotechnologies all roads were altered so that they have the same length. For the same reason moving using regular cars is not very popular in the country, and it can happen that there are such pairs of cities, one of which generally can not be reached by car from the other one. However, Cicasso is very conservative and cannot travel without the car. Choose cities so that the sculptor can make the tour using only the automobile. It is guaranteed that it is always possible to do. 

Input

In the first line there is a pair of integers n and m (4 ≤ n ≤ 3000, 3 ≤ m ≤ 5000) — a number of cities and one-way roads in Berland.

Each of the next m lines contains a pair of integers ui, vi (1 ≤ ui, vi ≤ n) — a one-way road from the city ui to the city vi. Note that ui and vi are not required to be distinct. Moreover, it can be several one-way roads between the same pair of cities. 

Output

Print four integers — numbers of cities which Cicasso will visit according to optimal choice of the route. Numbers of cities should be printed in the order that Cicasso will visit them. If there are multiple solutions, print any of them.

Example

Input

8 9
1 2
2 3
3 4
4 1
4 5
5 6
6 7
7 8
8 5


Output

2 1 8 7

Note

Let d(x, y) be the shortest distance between cities x and y. Then in the example d(2, 1) = 3, d(1, 8) = 7, d(8, 7) = 3. The total distance equals 13. 

Solution (in JAVA):

Solution:
import java.util.*;
public class B
{
	public static final int INFINITY = 100000000;
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		int m = in.nextInt();
		
		int[] us = new int[m];
		int[] vs = new int[m];
		int[] inDegree = new int[n];
		int[] outDegree = new int[n];
		for(int x = 0; x < m; x++)
		{
			us[x] = in.nextInt() - 1;
			vs[x] = in.nextInt() - 1;
			outDegree[us[x]]++;
			inDegree[vs[x]]++;
		}
		
		int[][] adj = new int[n][];
		int[][] rev = new int[n][];
		for(int y = 0; y < adj.length; y++)
		{
			adj[y] = new int[outDegree[y]];
			rev[y] = new int[inDegree[y]];
		}
		
		int[] ai = new int[n];
		int[] ri = new int[n];
		for(int z = 0; z < us.length; z++)
		{
			adj[us[z]][ai[us[z]]] = vs[z];
			ai[us[z]]++;
			
			rev[vs[z]][ri[vs[z]]] = us[z];
			ri[vs[z]]++;
		}
		
		int[][] fd = new int[n][];
		int[][] bd = new int[n][];
		for(int a = 0; a < adj.length; a++)
		{
			fd[a] = bfs(a, adj);
			bd[a] = bfs(a, rev);
		}
		
		int[][] fm = new int[n][];
		int[][] bm = new int[n][];
		for(int b = 0; b < adj.length; b++)
		{
			fm[b] = getMax(fd[b], b);
			bm[b] = getMax(bd[b], b);
		}
		
		int best = -INFINITY;
		int[] result = null;
		for(int b = 0; b < n; b++)
		{
			for(int c = 0; c < n; c++)
			{
				if(b != c)
				{
					for(int d = 0; d < 3; d++)
					{
						for(int e = 0; e < 3; e++)
						{
							if(bm[b][d] != fm[c][e] && bm[b][d] != c && fm[c][e] != b)
							{
								int current = fd[b][c] + bd[b][bm[b][d]] + fd[c][fm[c][e]];
								if(current > best)
								{
									best = current;
									result = new int[] {bm[b][d], b, c, fm[c][e]};
								}
							}
						}
					}
				}
			}
		}
		
		System.out.println((result[0] + 1) + " " + (result[1] + 1) + " " + (result[2] + 1) + " " + (result[3] + 1));
	}
	
	public static int[] getMax(int[] dist, int a)
	{
		int[] ret = new int[3];
		Arrays.fill(ret, -1);
		
		for(int i = 0; i < dist.length; i++)
		{
			if(i != a)
			{
				if(ret[0] == -1 || dist[i] > dist[ret[0]])
				{
					ret[2] = ret[1];
					ret[1] = ret[0];
					ret[0] = i;
				}
				else if(ret[1] == -1 || dist[i] > dist[ret[1]])
				{
					ret[2] = ret[1];
					ret[1] = i;
				}
				else if(ret[2] == -1 || dist[i] > dist[ret[2]])
				{
					ret[2] = i;
				}
			}
		}
		
		return ret;
	}
	
	public static int[] bfs(int start, int[][] adj)
	{
		ArrayDeque<Integer> queue = new ArrayDeque<Integer>();
		queue.add(start);
		
		int[] dist = new int[adj.length];
		Arrays.fill(dist, -INFINITY);
		dist[start] = 0;
		
		while(queue.size() > 0)
		{
			int node = queue.remove();
			
			for(int next : adj[node])
			{
				if(dist[next] == -INFINITY)
				{
					dist[next] = dist[node] + 1;
					queue.add(next);
				}
			}
		}
		
		return dist;
	}
}