#include <fstream>
#include <vector>
#include <queue>
#define nmax 100000
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,sol[nmax+5],t=0,s;
bool viz[nmax+5];
queue<int> Q;
vector<int> v[nmax+5];
void bfs()
{
    Q.push(s);
    int Node, Next;
    while(!Q.empty())
    {
        Node =  Q.front();
        Q.pop();
        for(unsigned int i = 0; i < v[Node].size(); i++)
        {
            Next = v[Node][i];
            if(sol[Next] == -1)
            {
                Q.push(Next);
                sol[Next] = sol[Node] + 1;
            }
        }
    }
}
int main()
{
    int x,y;
    fin>>n>>m>>s;
    for(int i=1;i<=n;i++)
        sol[i]=-1;
    while(fin>>x>>y)
        v[x].push_back(y);
    sol[s]=0;
    bfs();
    for(int i=1;i<n;i++)
        fout<<sol[i]<<" ";
    fout<<sol[n];
    fin.close();
    fout.close();
    return 0;
}