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

using namespace std;

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


#define NMAX 100000
typedef vector <int> graph[NMAX] ;

graph g;
int viz[NMAX],n,m,s;
queue <int> q;

void BFS(int x)
{
viz[x]=1;
q.push(x);
while(!q.empty())
{
    int aux=q.front();
    q.pop();
    for(int i=0;i<g[aux].size();i++)
    {
        int aux2=g[aux][i];
        if(viz[aux2]==0)
        {
            q.push(aux2);
            viz[aux2]=viz[aux]+1;
        }
    }
}
}
int main()
{
fin>>n>>m>>s;
int x,y;
for(int i=1;i<=m;i++)
{
    fin>>x>>y;
    g[x].push_back(y);
}
BFS(s);
for(int i=1;i<=n;i++)
{
    fout<<viz[i]-1<<" ";
}
}