#include<bits/stdc++.h>
using namespace std;

const int inf=(1e9);

class Graph
{

private:

    int m_nodes;

    vector< vector< pair<int,int> > > m_adjList;

    vector<pair<int, pair<int,int> > > m_edges;

    bool m_areLabeled;

public:

    Graph(int nodes,bool areLabeled)
    {
        m_nodes=nodes;
        m_areLabeled=areLabeled;

        m_adjList.resize(nodes+5);

    }


    void addEdge(int from, int to, int cost)
    {
        m_adjList[from].push_back(make_pair(to,cost));
        m_edges.push_back(make_pair(from,make_pair(to,cost)));
    }

    vector<int> bfs(int source)
    {
        queue<int> q;

        vector<int> distances(m_nodes+5,-1);

        distances[source]=0;

        q.push(source);


        while(!q.empty())
        {
            int current = q.front();

            q.pop();

            for(auto it: m_adjList[current])
            {
                if(distances[it.first]==-1)
                {
                    distances[it.first]=1+distances[current];
                    q.push(it.first);
                }
            }

        }


        return distances;

    }


};


int main()
{

    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    int n,m,x,y,source;

    scanf("%d%d%d",&n,&m,&source);

    Graph G(n,0);


    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);

        G.addEdge(x,y,0);
    }

    vector<int> solution=G.bfs(source);


    for(int i=1;i<=n;i++)
        printf("%d ",solution[i]);


    return 0;
}