import java.util.*;

public class Main {
	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	int m = sc.nextInt();
    	UnionFindTree uft = new UnionFindTree(n);
    	for (int i = 0; i < m; i++) {
    	    uft.unite(sc.nextInt() - 1, sc.nextInt() - 1);
    	}
    	StringBuilder sb = new StringBuilder();
    	for (int i = 0; i < n; i++) {
    	    sb.append(uft.find(i) + 1).append("\n");
    	}
    	System.out.print(sb);
	}
	
	static class UnionFindTree {
	    int[] parents;
	    int[] counts;
	    
	    public UnionFindTree(int size) {
	        parents = new int[size];
	        counts = new int[size];
	        for (int i = 0; i < size; i++) {
	            parents[i] = i;
	            counts[i] = 1;
	        }
	    }
	    
	    public int find(int x) {
	        if (x == parents[x]) {
	            return x;
	        } else {
	            return parents[x] = find(parents[x]);
	        }
	    }
	    
	    public void unite(int x, int y) {
	        int xx = find(x);
	        int yy = find(y);
	        if (xx == yy) {
	            return;
	        }
	        if ((counts[xx] == counts[yy] && xx < yy) || counts[xx] > counts[yy]) {
	            counts[xx] += counts[yy];
	            parents[yy] = xx;
	        } else {
	            counts[yy] += counts[xx];
	            parents[xx] = yy;
	        }
	    }
	}
}