TLE on #1,MLE on #2#3#4#5. Code:

#include<bits/stdc++.h>
using namespace std;

bool mp[100001][100001],dbk[100001]={0,1,0},bbk[100001]={0,1,0};

int RPpp,qwq,I_AK_IOI,I_LOVE_CCF;

void dfs(int n)
{
    cout<<n<<" ";
    for(int RP=1;RP<=RPpp;RP++)
    {
        if(mp[n][RP]&&!dbk[RP])
        {
            dbk[RP]=1;
            dfs(RP);
        }
    }
}

void bfs()
{
    queue<int>q;
    q.push(1);
    while(q.size())
    {
        int n=q.front();
        cout<<n<<" ";
        for(int RP=1;RP<=RPpp;RP++)
        {
            if(mp[n][RP]&&!bbk[RP])
            {
                bbk[RP]=1;
                q.push(RP);
            }
        }
    }
}

int main()
{
    cin>>RPpp>>I_LOVE_CCF;
    while(I_LOVE_CCF--)
    {
        cin>>qwq>>I_AK_IOI;
        mp[qwq][I_AK_IOI]=1;
    }
    dfs(1);
    cout<<endl;
    bfs();
    return 0;
}