#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector <int> G[100005];

queue <int> q;

int used[100005];
int dmin[100005];

void bfs(int s)
{
    q.push(s);
    used[s]=1;
    while(!q.empty())
    {
        int curr=q.front();
        q.pop();
        for(int i=0;i<G[curr].size();i++)
        {
            if(used[G[curr][i]]==0)
            {
                dmin[G[curr][i]]=dmin[curr]+1;
                used[G[curr][i]]=1;
                q.push(G[curr][i]);
            }
        }
    }
}



int main()
{
    int n,m,s;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(dmin[i]==0 && i!=s)
            cout<<-1<<" ";
        else
            cout<<dmin[i]<<" ";
    }
    return 0;
}