#include <bitset>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector <int> muchii[50001];
queue <int> q;
bitset <50001> viz;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector <int> sol;
void DFS(int nod)
{
    viz[nod] = 1;
    for(auto x : muchii[nod])
    {
        if(!viz[x])
            DFS(x);
    }
    sol.push_back(nod);

}
int main()
{

    int n,m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        cin >> x >> y;
        muchii[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--)
                cout << sol[i] << " ";
    return 0;
}