#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX = 1e5 + 5;
int n,m,s,x,y,level[NMAX],v1[NMAX];
queue <int> q;
vector <int> v[NMAX];
bool ap[100];
void read()
{
    fin>>n>>m>>s;
    for (int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        v[x].push_back(y);
        v1[x]=y;
    }
}
void bfs()
{
    ap[s]=true;
    level[s]=1;
    q.push(s);
    while (q.size())
    {
         x=q.front();
        for (auto &it : v[x])
        {
            if (!ap[it]) level[it]=level[x]+1,q.push(it);
            ap[it]=true;
        }
        q.pop();
    }
}
int main()
{
    read();
    bfs();
    for (int i=1; i<=n; ++i)
    fout<<v1[i]<<' ';
    fout<<'\n';
    for (int i=1; i<=n; ++i)
        fout<<level[i]-1<<' ';
    return 0;
}