#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

vector < vector <int> > g;
bitset <50005> viz;
vector <int> sol;
int n, m;

void citire()
{
    fin>>n>>m;
    g = vector < vector <int> > (n+2);
    int x, y;
    for (int i=1; i<=n; ++i)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
}

void dfs(int x)
{
    viz[x]=1;
    for (auto y:g[x])
        if (!viz[y]) dfs(y);
    sol.push_back(x);
}

void top_sort()
{
    for (int i=1; i<=n; ++i)
        if (!viz[i]) dfs(i);
    for (int i=n-1; i>=0; --i)
        fout<<sol[i]<<' ';
}

int main()
{
    citire();
    top_sort();
    return 0;
}