#include<fstream>
#include<vector>
#include <stack>
using namespace std;
#define NMAX 50005

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

vector<int> a[NMAX];
stack <int> tp;
int n,m,viz[NMAX];

void cit()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        fin >> x >> y;
        a[x].push_back(y);
    }
}
void dfs(int x)
{
    viz[x] = 1;
    vector <int>::iterator i;
    for(i = a[x].begin(); i != a[x].end(); ++i)
        if(!viz[*i])
            dfs(*i);

    tp.push(x);

}
int main()
{
    cit();
    for(int i=1;i<=n;++i)
        if(!viz[i])
            {
                dfs(i);
            }

   while(!tp.empty()){
        fout << tp.top() << " ";
        tp.pop();
   }
    return 0;
}