#include <fstream>
#include <queue>
#include <vector>
using namespace std;
int n,m,x,y,i,v[100005];
vector <int> w[100005];
queue <int> q;
int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>n>>m>>x;
    q.push(x);
    for(i=1; i<=n; i++)
    {
        v[i]=-1;
        w[i].push_back(0);
    }
    v[x]=0;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        w[x][0]++;
        w[x].push_back(y);
    }
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=1; i<=w[x][0]; i++)
        {
            if(v[w[x][i]]==-1)
            {
                v[w[x][i]]=v[x]+1;
                q.push(w[x][i]);
            }
        }
    }
    for(i=1; i<=n; i++)
    {
        g<<v[i]<<" ";
    }
    g<<'\n';
    f.close(); g.close();
    return 0;
}