#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bitset>
#include <cmath>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int N, M;
vector < int > G[50005], sol;
bitset < 50005 > viz;

void dfs(int nod)
{
    viz[nod]=1;
    int sz=G[nod].size();
    for (int i=0; i<sz; ++i)
        if (!viz[G[nod][i]]) dfs(G[nod][i]);

    sol.push_back(nod);
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
    {
        int x, y; f>>x>>y;
        G[x].push_back(y);
    }

    for (int i=1; i<=N; ++i)
        if (!viz[i]) dfs(i);

    for (int i=sol.size()-1; i>=0; --i)
        g<<sol[i]<<' '; g<<'\n';
    return 0;
}