#include <bits/stdc++.h>
using namespace std;

const int N = 10010;
int fa[N];

inline void init(int n)
{
    for (int i = 1; i <= n; i++)
        fa[i] = i;
}

inline int find(int x)
{
    return x == fa[x] ? x : (fa[x] = find(fa[x]));
}

inline void merge(int i, int j)
{
    fa[find(i)] = find(j);
}

int main()
{
    int n, m;
    cin >> n >> m;
    init(n);
    for (int i = 1; i <= m; i++)
    {
        int child, parent;
        cin >> child >> parent;
        merge(child, parent);
    }
    for (int i = 1; i <= n; i++)
    {
        cout << find(i) << " ";
    }
    return 0;
}