#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;

int main()
{
    ifstream in ("bfs.in");
    ofstream out ("bfs.out");

    vector<int> graf[100001];
    queue<int> q;
    int dist[100001], n, m, x, a, b, i;
    in>>n>>m>>x;
    for(i=1;i<=m;i++)
    {
        in>>a>>b;
        graf[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        dist[i]=INF;
    q.push(x);
    dist[x]=0;
    while(!q.empty())
    {
        i=q.front();
        q.pop();
        for(int y=0;y<graf[i].size();y++)
        {
            if(dist[graf[i][y]]==INF)
            {
                dist[graf[i][y]]=dist[i]+1;
                q.push(graf[i][y]);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(dist[i]==INF)
            dist[i]=-1;
        out<<dist[i]<<" ";
    }
}