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

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<vector<int>> graph;
queue<int> q;
struct marciuc
{
    int vizitat=0,dist;
};
marciuc lol[100001];
void bfs(int s)
{
    q.push(s);
    lol[s].vizitat=1;
    lol[s].dist=0;
    while(!q.empty())
    {
        int frn=q.front();
        q.pop();
        for(int i=0;i<graph[frn].size();i++)
        {
            if(lol[graph[frn][i]].vizitat==0)
            {
                q.push(graph[frn][i]);
                lol[graph[frn][i]].vizitat=1;
                lol[graph[frn][i]].dist=lol[frn].dist+1;
            }
        }
    }

}
int main()
{
    int n,m,s;
    fin>>n>>m>>s;
    graph.resize(n+1);
    for(int i=1;i<=m;i++)
    {
        int m1,m2;
        fin>>m1>>m2;
        graph[m1].push_back(m2);
    }
        bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(lol[i].dist==0 && i!=s)
            fout<<-1<<" ";
        else
            fout<<lol[i].dist<<" ";
    }
}