#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N = 100010;
vector<int> v[N];
int n,m,s,i,j,dist[N];
queue<int> q;
int main()
{
    f>>n>>m>>s;
    for(; m; m--)
    {
        f>>i>>j;
        v[i].push_back(j);
    }
    dist[s]=1;
    q.push(s);
    while(q.size())
    {
        int nod=q.front();
        q.pop();
        for(auto vec:v[nod])
            if(!dist[vec])
            {
                dist[vec]=dist[nod]+1;
                q.push(vec);
            }
    }
    for(i=1;i<=n;i++)
        g<<dist[i]-1;
    return 0;
}