#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

const int nmax=100005;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>l[nmax];
vector <int> drum(nmax,INT_MAX);
queue <int>Q;

void bfs()
{

    while(!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        for(int vec : l[node])
        {
            if(drum[vec]>drum[node]+1)
            {
                drum[vec]=drum[node]+1;
                Q.push(vec);
            }

        }

    }

}

int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        l[x].push_back(y);

    }
    drum[s]=0;
    Q.push(s);
    bfs();
    for(int i=1;i<=n;i++)
    {
        if(drum[i]==INT_MAX)
            drum[i]=-1;
        fout<<drum[i]<<' ';
    }
return 0;
}