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.*;
import java.text.*;
import java.lang.*;
import java.math.*;
 
public class Myclass{
	static ArrayList[] a=new ArrayList[200001];
	static boolean color[][]=new boolean [200001][4];
	static boolean visited[]=new boolean [200001];
	static int can[]=new int [200001];

	static void dfs(int n) {
		visited[n]=true;
		for(int i=1;i<=3;i++) {
			if(!color[n][i])
			{
				can [n]=i;
				break;
			}
		}
		for(int i=0;i<a[n].size();i++) {
			int idx=(int) a[n].get(i);
			color [ idx ][can [n]]=true;
		}
		for(int i=0;i<a[n].size();i++) {
			int idx=(int) a[n].get(i);
			if(!visited[idx]) {
				dfs(idx);
			}
		}
	}
    public void solve () {
    	InputReader in =new InputReader(System.in);
    	PrintWriter pw = new PrintWriter(System.out);
    	int n=in.nextInt();
    	int m = in .nextInt();
    	for(int i=0 ;i<=n;i++) {
    		a[i]=new ArrayList<Integer>();
    	}
    	for(int i = 0;i < m ;i++) {
    		int x = in.nextInt();
    		int y = in.nextInt();
    		a[x].add(y);
    		a[y].add(x);
    	}
    	dfs(1);
    	long cnt[]=new long[4];
    	for(int i=1;i<=n;i++) {
    		cnt[can[i]]++;
    		if(can[i]==0) {
    			pw.print(-1);
    			pw.flush();
    			pw.close();
    			return ;
    		}
    	}
    	long have=cnt[1]*cnt[2]+cnt[2]*cnt[3]+cnt[3]*cnt[1];
    	if(have==m && cnt[2]>0 && cnt[3]>0) {
    		for(int i=1;i<=n;i++) {
    			pw.print(can[i]+" ");
    		}
    	}
    	else
    		pw.print(-1);
    	pw.flush();
        pw.close();
    }
    public static void main(String[] args) throws Exception {
        
        
        new Thread(null,new Runnable() {
            public void run() {
                new Myclass().solve();
            }
        },"1",1<<26).start();
    }
   
    static void debug(Object... o) {
        System.out.println(Arrays.deepToString(o));
        }
        
        static class InputReader 
        {
        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;
        private SpaceCharFilter filter;
 
        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }
        public int snext() 
        {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) 
            {
                curChar = 0;
                try 
                {
                    snumChars = stream.read(buf);
                } 
                catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }
 
        public int nextInt() 
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = snext();
            }
            int res = 0;
            do 
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public long nextLong()
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = snext();
            }
            long res = 0;
            do 
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public int[] nextIntArray(int n) 
        {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) 
            {
                a[i] = nextInt();
            }
            return a;
        }
 
        public String readString()
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            StringBuilder res = new StringBuilder();
            do 
            {
                res.appendCodePoint(c);
                c = snext();
            } while (!isSpaceChar(c));
            return res.toString();
        }
 
        public String nextLine() 
        {
            int c = snext();
            while (isSpaceChar(c))
                c = snext();
            StringBuilder res = new StringBuilder();
            do 
            {
                res.appendCodePoint(c);
                c = snext();
            } while (!isEndOfLine(c));
            return res.toString();
        }
 
        public boolean isSpaceChar(int c) 
        {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
 
        private boolean isEndOfLine(int c) 
        {
            return c == '\n' || c == '\r' || c == -1;
        }
 
        public interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
        }
    }
        public static long mod = 1000000007;
        public static int d;
        public static int p;
        public static int q;
        public void extended(int a,int b) {
            if(b==0) {
                d=a;
                p=1;
                q=0;
            }
            else
            {
                extended(b,a%b);
                int temp=p;
                p=q;
                q=temp-(a/b)*q;
            }
        }
        public static int binaryExponentiation(int x,int n)
        {
            int result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=result * x;
                x=x*x;
                n=n/2;
            }
            return result;
        }
        
        public static long binaryExponentiation(long x,long n)
        {
            long result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=result * x;
                x=x*x;
                n=n/2;
            }
            return result;
        }
        
        public static long[] shuffle(long[] a,Random gen)
        {
            int n = a.length;
            for(int i=0;i<n;i++)
            {
                int ind = gen.nextInt(n-i)+i;
                long temp = a[ind];
                a[ind] = a[i];
                a[i] = temp;
            }
            return a;
        }
        
        public static void swap(int a, int b){
            int temp = a;
            a = b;
            b = temp;
        }
        
        public static HashSet<Integer> primeFactorization(int n)
        {
            HashSet<Integer> a =new HashSet<Integer>();
            for(int i=2;i*i<=n;i++)
            {
                while(n%i==0)
                {
                    a.add(i);
                    n/=i;
                }
            }
            if(n!=1)
                a.add(n);
            return a;
        }
        
        public static void sieve(boolean[] isPrime,int n)
        {
            for(int i=1;i<n;i++)
                isPrime[i] = true;
            
            isPrime[0] = false;
            isPrime[1] = false;
            
            for(int i=2;i*i<n;i++)
            {
                if(isPrime[i] == true)
                {
                    for(int j=(2*i);j<n;j+=i)
                        isPrime[j] = false;
                }
            }
        }
        
        public static long GCD(long n,long m)
        {
            if(m==0)
                return n;
            else
                return GCD(m,n%m);
        }
        
        static class pair implements Comparable<pair>
        {
          Long x;
		 Integer y;
            pair(long l,int m)
            {
                this.x=l;
                this.y=m;
            }
 
           
 
			public int compareTo(pair o) {
                int result = x.compareTo(o.x);
                if(result==0)
                    result = y.compareTo(o.y);
                
                return result;
            }  
            
            public String toString()
            {
                return (x)+" "+(y);
            }
            
            public boolean equals(Object o)
            {
                if (o instanceof pair)
                {
                    pair p = (pair)o;
                    return p.x.equals(x) && p.y.equals(y) ;
                }
                return false;
            }
            
            public int hashCode()
            {
                return new Long(x).hashCode()*31 + new Long(y).hashCode();
            }
        }
        public static int modularExponentiation(int x,int n,int M)
        {
            int result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=(result * x)%M;
                x=(x%M*x)%M;
                n=n/2;
            }
            return result;
        }
        
        public static long modularExponentiation(long x,long n,long M)
        {
            long result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=(result%M * x%M)%M;
                x=(x%M * x%M)%M;
                n=n/2;
            }
            return result;
        }
        
        public static long modInverse(int A,int M)
        {
            return modularExponentiation(A,M-2,M);
        }
        
        public static long modInverse(long A,long M)
        {
            return modularExponentiation(A,M-2,M);
        }
        
    
}
 
class dsu{
    int parent[];
    long sz[];
    dsu(int n){
        parent=new int[n+1];
        sz=new long[n+1];
        for(int i=0;i<=n;i++)
        {
            parent[i]=i;
            sz[i]=1;
        }
    }
    int root(int n) {
        while(parent[n]!=n)
        { 
            parent[n]=parent[parent[n]];
            n=parent[n];
        }
        return n;
    }
    void union(int _a,int _b) {
        int p_a=root(_a);
        int p_b=root(_b);
        
        parent[p_a]=p_b;
        sz[p_b]+=sz[p_a];
            
    }
    long find(int a,int b) {
    	int root_a=root(a);
    	int root_b=root(b);
        if(root_a==root_b)
            return 0;
        else
            return  sz[root_a]*sz[root_b];
    }
    
    
}
class Segment{ 
    long seg[];
    int [] a;
    static long mod = (long) (1e9+7);
    Segment (int n,int i){
        seg=new long[4*n];
        a=new int [n];
        if(i==0) {
        	a[0]=1;
        }
    }
    public void build(int node,int start,int end) {
        if(start==end) {
            seg[node]=a[start];
            return ;
        }
        int mid=(start+end)/2;
        build(2*node+1,start,mid);
        build(2*node+2,mid+1,end);
        seg[node]=(seg[2*node+1]%mod+seg[2*node+2]%mod)%mod;
    }
    
   
    public void update(int node,int start,int end,int fi,long val) {
        if(start==end) {
            seg[node]+=val;
            seg[node]%=mod;
            return;
        }
        int mid=(start+end)/2;
        if(fi>=start && fi<=mid) {
            update(2*node+1,start,mid,fi,val);
        }
        else
            update(2*node+2,mid+1,end,fi,val);
        seg[node]=(seg[2*node+1]+seg[2*node+2])%mod;
    }
    public long query(int node,int start,int end,int l,int r) {
        if(l>end || r<start)
            return 0;
        if(start>=l && end<=r)
            return seg[node];
        
        int  mid=(start+end)/2;
        return (query(2*node+1,start,mid,l,r)+query(2*node+2,mid+1,end,l,r))%mod;
    }
    /*public void updateRange(int node,int start,int end,int l,int r,int val) {
        if(lazy[node]!=0) {
            seg[node]-=lazy[node];
            if(start!=end) {
                lazy[2*node+1]+=lazy[node];
                lazy[2*node+2]+=lazy[node];
            }
            lazy[node]=0;
        }
        if(l>end || r<start)
            return ;
        if(start>=l && end<=r) {
            seg[node]-=val;
            if(start!=end) {
                lazy[2*node+1]+=val;
                lazy[2*node+2]+=val;
            }
            return ;
        }
        int mid=(start+end)/2;
        updateRange(2*node+1,start,mid,l,r,val);
        updateRange(2*node+2,mid+1,end,l,r,val);
        seg[node]=Math.min(seg[2*node+1],seg[2*node+2]);
    }
    public long queryRange(int node,int start,int end,int l,int r) {
        if(lazy[node]!=0L) {
            seg[node]-=lazy[node];
            if(start!=end) {
                lazy[2*node+1]+=lazy[node];
                lazy[2*node+2]+=lazy[node];
            }
            lazy[node]=0;
        }
        if(l>end || r<start)
            return Long.MAX_VALUE;
        if(start>=l && end<=r)
            return seg[node];
        
        int  mid=(start+end)/2;
        return Math.min(queryRange(2*node+1,start,mid,l,r),queryRange(2*node+2,mid+1,end,l,r));
    }*/
    
}
class query{
	Long x;
	Integer y;
	query(long x,int y){
		this.x=x;
		this.y=y;
	}
}