#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n,m,s,x,y,i,v;
vector <int> g[100005];
queue <int> q;
int d[100005];


int main()
{
    fin>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        d[i]=-1;
    d[s]=0;
    q.push(s);
    while (!q.empty())
    {
        v=q.front();
        q.pop();
        for(i=0; i<g[v].size();i++)
        if (d[g[v][i]]==-1)
        {
            q.push(g[v][i]);
            d[g[v][i]]=d[v]+1;
        }
    }
    for (i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}