#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

#define nmax 50001

using namespace std;

int n, m, i, x, y;
bool viz[nmax];
vector <int> G[nmax];
stack <int> s;

void sortaret(int nod)
{
    viz[nod] = true;
    for (int i = 0; i < G[nod].size(); i++)
        sortaret(G[nod][i]);
    s.push(nod);
}

int main()
{
    
    ifstream fi("sortaret.in");
    ofstream fo("sortaret.out");
    
    fi >> n >> m;
    
    for (i = 1; i <= m; i++)
    {
        fi >> x >> y;
        G[x].push_back(y);
    }
    
    for (i = 1; i <= n; i++)
        if (!viz[i])
            sortaret(i);
    
    while (!s.empty())
    {
        fo << s.top() << " ";
        s.pop();
    }
    
    fi.close();
    fo.close();
    
    return 0;
}