#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N = 50010;
int n,m,x,y,gr[N];
vector<int> v[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(; m; m--)
    {
        f>>x>>y;
        v[x].push_back(y);
        gr[y]++;
    }
    for(x=1;x<=n;x++)
        if(!gr[x])
            q.push(x);
    while(q.size())
    {
        x=q.front();
        g<<x<<' ';
        q.pop();
        for(auto vec:v[x])
        {
            gr[vec]--;
            if(!gr[vec])
                q.push(vec);
        }
    }
    return 0;
}