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

using namespace std;
int n,m,s,d[200002];
vector <int> v[200002];
queue <int> q;


int main()
{ifstream f ("bfs.in");
    f>>n>>m>>s;
int x,y,i;
for (i=1;i<=m;i++)
    {f>>x>>y;
        v[x].push_back (y);
    }
for (i=1;i<=m;i++)
d[i]=-1;
d[s]=0;
q.push(s);
while (!q.empty())
    {x=q.front();
    q.pop();
for (i=1;i<=v[x].size();i++)
        {y=v[x][i];
            if (d[y]==-1)
            {q.push (y);
             d[y]=d[x]+1;
            }
        }
    }
ofstream g ("bfs.out");
for (i=1;i<=n;i++)
g<<d[i]<<" ";
return 0;
}