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

using namespace std;

const int emax = 100005;

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

queue <int> q;
class Graph{

public:

    int noduri, muchii;

    vector<int> adj[emax];

    Graph(int _noduri, int _muchii): noduri(_noduri), muchii(_muchii){
        q = queue<int>();
    }

    virtual void build() = 0;
    virtual void bfs(int source) = 0;
    virtual void dfs() = 0;
    virtual void sol() = 0;
};

class OrientedGraph : public Graph{

public:
    int dist[emax];

    OrientedGraph(int _noduri, int _muchii): Graph(_noduri, _muchii){
            for(int i = 1; i <= noduri; ++i)
                dist[i] = -1;
    }

    virtual void build() override{
        for(int i = 0; i < muchii; ++i){
            int x, y;
            in >> x >> y;
            adj[x].push_back(y);
            }
        }
    void bfs(int source) override{
        q.push(source);
        dist[source] = 0;
        while(!q.empty())
        {
            int crt = q.front();
            q.pop();
            for(unsigned i = 0; i < adj[crt].size(); ++i)
                {
                    if(dist[adj[crt][i]] == -1)
                        {
                            dist[adj[crt][i]] = 1 + dist[crt];
                            q.push(adj[crt][i]);
                        }
                }
        }
    }

    void sol(){
        for(int i = 1; i <= noduri; ++i)
                out << dist[i] << " ";
    }
    void dfs(){
    }
};

int main()
{
    int N, M, S;
    in >> N >> M;
    Graph* g = new OrientedGraph(N, M);

    in >> S;

    g->build();

    g->bfs(S);

    g->sol();
    return 0;

}