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

using namespace std;

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

int n,m,s;

vector<vector<int>> graf;
int dist[100001];

queue<int> q;

int main()
{
    in>>n>>m>>s;
    graf.resize(n+1);
    for(int i = 1; i<=m; i++)
    {
        int x,y;
        in>>x>>y;
        graf[x].push_back(y);
    }
    q.push(s);
    dist[s]=1;
    while(!q.empty())
    {
        for(auto x : graf[q.front()])
        {
            if(dist[x]==0)
            {
                dist[x]=dist[q.front()]+1;
                q.push(x);
            }
        }
        q.pop();
    }
    for(int i = 1;i<=n;i++)
    {
        out<<dist[i]-1<<' ';
    }
    return 0;
}