#include <fstream>
#include <vector>
#include <queue>
#define N 100010
#define M 1000010
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,s,x,y,dist[N];
vector<int> v[N];
queue<int> q;
int main()
{
    f>>n>>m>>s;
    for(;m;m--)
    {
        f>>x>>y;
        v[x].push_back(y);
        ///v[y].push_back(x);
    }
    q.push(s);dist[s]=1;
    for(;q.size();)
    {
        x=q.front();
        q.pop();
        for(auto vec:v[x])
            if(!dist[vec])
            {
                dist[vec]=dist[x]+1;
                q.push(vec);
            }
    }
    for(int i=1;i<=n;i++)
        g<<dist[i]-1<<' ';
    return 0;
}