#include <fstream>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int sol[100000 + 3];
int S,n,m;
struct bfs
{
    int nod;
    int pas;
} ;
queue <bfs> q;
vector <int> adj[100000 + 3];

void BFS ()
{
    q.push({S, 0});
    sol[S] = 0;
    while(!q.empty())
    {
        bfs tmp = q.front();
        q.pop();
        for(int i = 0; i < adj[tmp.nod].size(); ++i)
        {
            if(sol[adj[tmp.nod][i]] != -1) continue;
            q.push({adj[tmp.nod][i], tmp.pas + 1});
            sol[adj[tmp.nod][i]] = tmp.pas + 1;

        }
    }
}


int main()
{
    int x,y;
    cin >> n >> m >> S;
    for (int i=1; i<=m; i++)
    {
        cin >> x >> y;
        adj[x].push_back(y);
    }
    for(int i = 0; i< 100000; ++i) sol[i] = -1;
    BFS();
    for (int i=1;i<=n;i++)
      cout << sol[i] << " ";


}