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

using namespace std;

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

bool visit[100010];
int dist[100010];
int main()
{
    int n,m,s,a,b;
    fin>>n>>m>>s;
    vector<vector<int>>v(n+1);
    while(m)
    {
        m--;
        fin>>a>>b;
        if(a!=b)
            v[a].push_back(b);
    }
    
    
    queue<int> q;
    q.push(s);
    visit[s]=1;
    dist[s]=0;
    
    while(!q.empty())
    {
        for(int i=0;i<v[q.front()].size();i++)
        {
            if(visit[v[q.front()][i]]==0)
            {
                dist[v[q.front()][i]]=dist[q.front()]+1;
                q.push(v[q.front()][i]);
                visit[v[q.front()][i]]=1;
            }
        }
        q.pop();
    }
    for(int i=1;i<=n;i++)
    {
        if(i==s)
            fout<<0<<" ";
        else
            if(dist[i]==0)
                fout<<-1<<" ";
            else
                fout<<dist[i]<<" ";
    }
    
    
    return 0;
}