#include<cstdio>
#include<vector>

using namespace std;

const int N = 100005;

int n, m, nivel[N], nivelmin[N], urm[N];

vector <int> v[N];

bool marcat[N];

void citire() {
    scanf("%d%d", &n, &m);

    int x, y;

    for (int i = 1; i <= m; ++i) {
        scanf("%d%d", &x, &y);

        v[x].push_back(y);
        v[y].push_back(x);
    }

}

void dfs(int nod, int pred) {
    marcat[nod] = true;

    bool gasit = false;

    for (int i = 0; i < (int)v[nod].size(); ++i)
        if (!marcat[v[nod][i]]) {
            nivel[v[nod][i]] = nivel[nod] + 1;

            urm[nod] = v[nod][i];

            gasit = true;

            dfs(v[nod][i], nod);
        }
    if (!gasit) {
        nivelmin[nod] = nivel[nod];

        for (int i = 0; i < (int)v[nod].size(); ++i)
            if (v[nod][i] != pred)
                nivelmin[nod] = min(nivelmin[nod], nivel[v[nod][i]]);
    }
    if (gasit) {
        nivelmin[nod] = min(nivel[nod], nivelmin[urm[nod]]);
        for (int i = 0; i < (int)v[nod].size(); ++i)
            if (v[nod][i] != pred)
                nivelmin[nod] = min(nivelmin[nod], nivel[v[nod][i]]);
    }
}

void afis(int nod, bool afisare) {
    marcat[nod] = true;

    if (afisare)
        printf("%d ", nod);

    if (nivelmin[nod] >= nivel[nod]) {
        for (int i = 0; i < (int)v[nod].size(); ++i)
            afis(v[nod][i], true);
    }
    else {
        for (int i = 0; i < (int)v[nod].size(); ++i)
            afis(v[nod][i], false);
    }
}

int main() {
    freopen("biconex.in", "r", stdin);
    freopen("biconex.out", "w", stdout);

    citire();

    nivel[1] = 1;

    dfs(1,0);

    nivelmin[1] = 0;

    for (int i = 0; i < N; ++i)
        marcat[i] = false;

    afis(1, false);

    for (int i = 1; i <= n; ++i)
        printf("%d ",nivelmin[i]);

    return 0;
}