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 D_1228 {

    static ArrayList<Integer>[] g;
    static int[] set;
    static boolean can;

    static class Edge {
        int v, u;

        Edge(int v, int u) {
            this.v = v;
            this.u = u;
        }
    }

    static void dfs(int v) {
        for (int u : g[v]) {
            if (set[u] == 0) {
                set[u] = set[v] ^ 1;
                dfs(u);
            } else if (set[u] == set[v]) {
                can = false;
            }
        }
    }

    static void solve(FastReader in, PrintWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();

        can = true;

        g = new ArrayList[1 + n];
        Arrays.setAll(g, i -> new ArrayList<>());

        ArrayList<Edge> edges = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            int v = in.nextInt();
            int u = in.nextInt();
            g[v].add(u);
            g[u].add(v);
            edges.add(new Edge(v, u));
        }

        set = new int[1 + n];
        Arrays.fill(set, 1, 1 + n, 1);
        for (int v : g[1]) {
            set[v] = 0;
        }

        for (int v = 1; v <= n; v++) {
            if (set[v] == 0) {
                set[v] = 2;
                dfs(v);
                break;
            }
        }

        if (!can) {
            out.println(-1);
            return;
        }

        boolean[] nonEmpty = new boolean[4];
        for (int v = 1; v <= n; v++) {
            nonEmpty[set[v]] = true;
        }

        if (nonEmpty[0] || !nonEmpty[1] || !nonEmpty[2] || !nonEmpty[3]) {
            out.println(-1);
            return;
        }

        for (Edge e : edges) {
            if (set[e.v] == set[e.u]) {
                out.println(-1);
                return;
            }
        }

        int[] cnt = new int[4];
        for (int v = 1; v <= n; v++) {
            cnt[set[v]]++;
        }

        for (int v = 1; v <= n; v++) {
            if (g[v].size() != cnt[1] + cnt[2] + cnt[3] - cnt[set[v]]) {
                out.println(-1);
                return;
            }
        }

        for (int v = 1; v <= n; v++) {
            out.print(set[v] + " ");
        }
        out.println();
    }

    public static void main(String[] args) {
        FastReader in = new FastReader(System.in);
//        FastReader in = new FastReader(new FileInputStream("input.txt"));
        PrintWriter out = new PrintWriter(System.out);
//        PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));

        int q = 1;

        while (q-- > 0)
            solve(in, out);

        out.close();
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        FastReader(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

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

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

        Double nextDouble() {
            return Double.parseDouble(next());
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(nextLine());
            }
            return st.nextToken();
        }

        String nextLine() {
            String s = "";
            try {
                s = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return s;
        }
    }
}
