#include <fstream>
#include <vector>

using namespace std;

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

bool f[50010],t[50010];
int k, n,m,x,y,i,v[50010];

vector <int> l[50010];

void dfs (int nod){

    f[nod]=1;
    for (int i=0;i<l[nod].size();i++) {
        if (f[l[nod][i]]==0)
            dfs(l[nod][i]);
    }
    v[++k]=nod;
}

int main () {

    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        l[x].push_back(y);
        t[y]=1;
    }
    for (i=1;i<=n;i++)
        if (t[i]==0)
            dfs(i);

    for (i=n;i>=1;i--)
        fout<<v[i]<<" ";

    return 0;
}