#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,Dmin[100001];
int start;
vector<vector<int>>G(200001);

void BFS(int nod)
{
    queue<int>Q;
    Q.push(nod);
    Dmin[nod]=1;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(auto x:G[nod])
            if(Dmin[x]==0)
                {
                    Dmin[x]=Dmin[nod]+1;
                    Q.push(x);
                }
    }
}

int main()
{
    cin>>n>>m>>start;

    for(int i=1,x,y;i<=m; ++i)
    {
        cin>>x>>y;
        G[x].push_back(y);
    }
    BFS(start);
    for(int i=1 ;i<=n; ++i)
        if(Dmin[i])
            cout<<Dmin[i]-1<<" ";
        else
            cout<<-1<<" ";
    return 0;
}