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

using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
void dfs(int nod);
void bfs(int nod);

vector<int> graf[100001];
int dist[100001];
int n, m, s;

int main()
{
    cin>>n>>m>>s;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin>>x>>y;
        graf[x].push_back(y);
    }
    bfs(s);
    for(int i = 1; i <= n; ++i)
        cout<<dist[i] - 1<<" ";

    return 0;
}


void bfs(int start)
{
    dist[start] = 1;
    queue<int> q;
    q.push(start);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto i : graf[nod])
        {
            if(dist[i] == 0 || dist[i] > dist[nod] + 1)
            {
                dist[i] = dist[nod] + 1;
                q.push(i);
            }
        }
    }

}
//void dfs(int nod)
//{
//    vizitat[nod] = 1;
//    for(auto i : graf[nod])
//    {
//        if(vizitat[i])
//            continue;
//        dfs(i);
//    }
//}