#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ofstream cout("bfs.out");
ifstream cin ("bfs.in");
vector <int> dist;
vector <vector <int> > gr;
void bfs(int cur)
{
    queue <int> q;
    q.push(cur);
    while(!q.empty())
    {
        cur=q.front();
        for(int i=0;i<gr[cur].size();i++)
        {
            int vec=gr[cur][i];
            if(dist[vec]==-1)
            {
                dist[vec]=dist[cur]+1;;
                q.push(vec);
            }
        }
        q.pop();
    }

}
int main()
{
    int n,m,s;
    cin>>n>>m>>s;
    gr.resize(n+1);
    dist.resize(n+1);
    dist.assign(n+1,-1);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        gr[a].push_back(b);
    }
    dist[s]=0;
    bfs(s);
    for(int i=1;i<=n;i++)
        cout<<dist[i]<<' ';
    return 0;
}