#include <fstream>
#include <vector>
using namespace std;

int c[50003], in[50003], n, m;
vector <int> a[50003];

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int main()
{
    f>>n>>m;
    int i, j;
    for (i=1; i<=m; ++i) {
        int x, y;
        f>>x>>y;
        a[x].push_back(y);
        ++in[y];
    }
    for (i=1; i<=n; ++i)
        if (in[i]==0)
            c[++c[0]]=i;
    for (i=1; i<=n; ++i)
        for (j=0; j<a[c[i]].size(); ++j) {
            --in[a[c[i]][j]];
            if (in[a[c[i]][j]]==0)
                c[++c[0]]=a[c[i]][j];
        }
    for (i=1; i<=n; ++i)
        g<<c[i]<<' ';
    return 0;
}