#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");


class graf {
private:
    int n, m;
    int viz[100003], dist[100003];
    bool orientat = false;
    vector<int> h[100003];
    queue< pair<int, int> >q;

    void dfs(int nod)
    {
        viz[nod] = 1;
        for(auto i : h[nod])
            if(!viz[i])
                dfs(i);
    }

    void bfs(int s)
    {
        int i, d = 0;
        pair<int, int> nod;
        q.push({s, 0});
        viz[s] = 1;
        dist[s] = 0;

        while(!q.empty())
        {
            nod = q.front();
            dist[nod.first] = nod.second;
            q.pop();

            for(auto i : h[nod.first])
                if(!viz[i])
                {
                    q.push({i, nod.second + 1});
                    viz[i] = 1;
                }
        }
    }

public:
    graf()
    {
        for(int i = 1; i <= 100003; i++)
            dist[i] = -1;
    }

    void set_graf(int noduri, int muchii, bool Orientat)
    {
        n = noduri;
        m = muchii;
        orientat = Orientat;
    }

    void adauga_muchie(int x, int y)
    {
        if(orientat)
            h[x].push_back(y);
        else
        {
            h[x].push_back(y);
            h[y].push_back(x);
        }
    }

    void conexe()
    {
        int i, nrc;
        nrc = 0;
        for(i = 1; i <= n; i++)
            if(!viz[i])
            {
                dfs(i);
                nrc++;
            }
        fout << nrc << "\n";
    }

    void distante(int s)
    {
        bfs(s);
        for(int i = 1; i <= n; i++)
            fout << dist[i] << " ";
        fout << "\n";
    }
};

graf g;

int main()
{
    int n, m, s, x, y, i;

    fin >> n >> m >> s;
    g.set_graf(n, m, true);

    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        g.adauga_muchie(x,y);
    }
    g.distante(s);

    fin.close();
    fout.close();
    return 0;
}