#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue <int> Q;
vector <int> nodes[100100];
int n, m, s, x, y, i, now, go_to;
int dist[100100], visit[100100];

int main()
{
    fin>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        nodes[x].push_back(y);
    }
    visit[s]=1;
    Q.push(s);
    dist[s]=1;

    while (!Q.empty())
    {
        now=Q.front();
        Q.pop();
        go_to=nodes[now].size();
        for (i=0;i<go_to;i++)
        {
            if (visit[nodes[now][i]]==0)
            {
                Q.push(nodes[now][i]);
                visit[nodes[now][i]]=1;
                dist[nodes[now][i]]=dist[now]+1;
            }
        }
    }

    for (i=1;i<=n;i++)
        fout<<dist[i]-1<<" ";

return 0;
}