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

using namespace std;

ifstream cin ("bfs.in");
ofstream cout ("bfs.out");

const int LIM = 100005;
int n, m, s, viz[LIM];
vector <int> gr[LIM];
queue <int> q;

void bfs (int nod)
{
    viz[nod] = 1;
    q.push(nod);
    while(q.empty() != 0)
    {
        nod = q.front();
        q.pop();
        for(int i = 0; i < gr[nod].size(); ++i)
        {
            if(viz[gr[nod][i]] == 0)
            {
                viz[gr[nod][i]] = viz[nod] + 1;
                q.push(gr[nod][i]);
            }
        }
    }
}
int main()
{
    cin>>n>>m>>s;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin>>x>>y;
        gr[x].push_back(y);
    }
    bfs(s);
    for(int i = 1; i <= n; ++i)
    {
        cout<<viz[i]-1;
    }
    return 0;
}