#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int nx=50002;
vector < int > v[nx];
deque < int > s;
bitset < nx > viz;
int n,m,i,j;
void dfs (int nod)
{
    viz.set(nod);
    for(vector < int > :: iterator it=v[nod].begin(); it!=v[nod].end(); it++)
        if(!viz.test(*it))
            dfs(*it);
    s.push_front(nod);
}
int main()
{
    in>>n>>m;
    for(;m;m--)
    {
        in>>i>>j;
        v[i].push_back(j);
    }
    for(i=1; i<=n; i++)
        if(!viz.test(i))
            dfs(i);
    for(deque < int > :: iterator it=s.begin(); it!=s.end(); it++)
        out<<*it<<' ';
    return 0;
}