You have a simple undirected graph consisting of n vertices and m edges. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.

Let's make a definition.

Let v_1 and v_2 be two some nonempty subsets of vertices that do not intersect. Let f(v_{1}, v_{2}) be true if and only if all the conditions are satisfied:

  1. There are no edges with both endpoints in vertex set v_1. 
  2. There are no edges with both endpoints in vertex set v_2. 
  3. For every two vertices x and y such that x is in v_1 and y is in v_2, there is an edge between x and y. 



Create three vertex sets (v_{1}, v_{2}, v_{3}) which satisfy the conditions below;

  1. All vertex sets should not be empty. 
  2. Each vertex should be assigned to only one vertex set. 
  3. f(v_{1}, v_{2}), f(v_{2}, v_{3}), f(v_{3}, v_{1}) are all true. 



Is it possible to create such three vertex sets? If it's possible, print matching vertex set for each vertex.

Input

The first line contains two integers n and m (3 ≤ n ≤ 10^{5}, 0 ≤ m ≤ min(3 ⋅ 10^{5}, (n(n-1))/(2))) — the number of vertices and edges in the graph.

The i-th of the next m lines contains two integers a_{i} and b_{i} (1 ≤ a_{i} < b_{i} ≤ n) — it means there is an edge between a_{i} and b_{i}. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.

Output

If the answer exists, print n integers. i-th integer means the vertex set number (from 1 to 3) of i-th vertex. Otherwise, print -1.

If there are multiple answers, print any.

Examples

Input


6 11
1 2
1 3
1 4
1 5
1 6
2 4
2 5
2 6
3 4
3 5
3 6


Output


1 2 2 3 3 3 

Input


4 6
1 2
1 3
1 4
2 3
2 4
3 4


Output


-1

Note

In the first example, if v_{1} = \{ 1 \}, v_{2} = \{ 2, 3 \}, and v_{3} = \{ 4, 5, 6 \} then vertex sets will satisfy all conditions. But you can assign vertices to vertex sets in a different way; Other answers like "2 3 3 1 1 1" will be accepted as well.

<image>

In the second example, it's impossible to make such vertex sets.

import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        new Main().solve();
    }
    static FastScanner in;
    static PrintWriter out;
    static int n,m;
    static int ans[];
    static ArrayList<Integer>[]g;
    void read() throws IOException {
        in = new FastScanner(System.in);
      int t = 1;
      while (t-- > 0){
      n = in.nextInt();
      m = in.nextInt();
      g = new ArrayList[n];
          for (int i = 0; i < n; i++) {
              g[i]= new ArrayList<>();
          }
          for (int i = 0; i < m; i++) {
              int from = in.nextInt() - 1;
              int to = in.nextInt() - 1;
              g[from].add(to);
              g[to].add(from);
          }
    }
    }
    void split(int x){
        boolean ban[] = new boolean[n];
        for (int i = 0; i < n; i++) {
            if(ans[i] == 0 && !ban[i]){
                //Чекаем, что пока вершина i не в множестве и еще может входить в сет x
                //Пусть она будет в множестве x
                ans[i] = x;
                for (int j = 0; j < g[i].size(); j++) {
                    //находим вершины, которые не входят в этот сет и помечаем,что их не берем
                    ban[g[i].get(j)] = true;
                }
            }
        }
    }
    void recheck(){
     int set[] = new int[3];
        for (int i = 0; i < n; i++) {
            if(ans[i] == 0)impossible();
            //проверка, вдруг мы не нашли сета для вершины i, тогда ответа нет
            set[ans[i] - 1]++;
        }
        for (int i = 0; i < 3; i++) {
            if(set[i] == 0)impossible();
            //проверка, что множества непустые
        }
        //проверка, что количество ребер совпадает
        if((long)set[0] * set[1] + set[1] * set[2] + set[0] * set[2] != m)impossible();
        //если выполняются эти условия, то ответ есть
        for (int i = 0; i < n; i++) {
            System.out.print(ans[i] + " ");
        }
    }
    void impossible(){
        System.out.println(-1);
        System.exit(0);
    }
    void solve() throws IOException {
        read();
        ans = new int[n];
        split(1);
        split(2);
        split(3);
        //находим вершины трех множеств
        recheck();
        //чекаем
    }
}
class FastScanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");

    FastScanner(InputStream f) throws FileNotFoundException {
        br = new BufferedReader(new InputStreamReader(f));
    }

    String next() throws IOException {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

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