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

ifstream is("sortaret.in");
ofstream os("sortaret.out");

vector< vector<int> > G;

int n, m;
int a, b, cnt;
bool viz[50001];
int sol[50001];

void Read()
{
    is >> n >> m;
    G.resize(n+1);
    for (int i = 1; i <= m; ++i)
    {
        is >> a >> b;
        G[a].push_back(b);
    }
}

void DFS(int nod)
{
    viz[nod] = true;
    for (const auto &vec : G[nod])
        if (!viz[vec])
            DFS(vec);
    sol[++cnt] = nod;
}

void Solve()
{
    for (int i = 1; i <= n; ++i)
        if (!viz[i])
            DFS(i);
}


void Write()
{
    for (int i = cnt; i >= 1; --i)
        os << sol[i] << ' ';
}

int main()
{
    Read();
    Solve();
    Write();

    is.close();
    os.close();
    return 0;
}