#include <fstream>
#include <vector>
#include <queue>
using namespace std;

int main()
{
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;fin>>n>>m>>s;
vector<vector<int>> liste(n+1);
for(int i=0;i<=m-1;i++){
    int x,y;fin>>x>>y;
    liste[x].push_back(y);
}
vector<int> dist(n+1,-1);
queue<int> q;
q.push(s);
dist[s]=0;
while(q.empty()==0){
    int x=q.front();
    q.pop();
    for(int i=0;i<liste[x].size();i++){
        int y=liste[x][i];
        if(dist[y]==-1){
            dist[y]=dist[x]+1;
            q.push(y);
        }
    }

}
for(int i=1;i<=n;i++)
    fout<<dist[i]<<" ";
return 0;
}