#include <fstream>
#include <list>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,i,j,x,y,fst,m;
list<int> lst[50001];
list<int> L[50001];
vector<int> v;
list<int>::iterator it;
int s[50001];
queue<int> q;

int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        lst[x].push_back(y);
        s[y]++;
    }
    for (i=1;i<=n;i++)
    {
        if (s[i]==0)
            q.push(i);
    }
    while (q.empty() == false)
    {
        fst=q.front();
        q.pop();
        v.push_back(fst);
        while (lst[fst].empty() == false)
        {
            it=lst[fst].begin();
            s[*it]--;
            if (s[*it] == 0)
            {
                q.push(*it);
            }
            lst[fst].erase(it);
        }
    }
    for (vector<int>::iterator it = v.begin(); it != v.end(); ++it)
    {
        fout<<*it<<" ";
    }
    return 0;
}