#include <fstream>
#include <vector>
using namespace std;
vector<int> a[50010];
int f[50010];
int sol[50010];
int i,j,n,m,u,x,y;

void dfs (int nod) {
    f[nod]=1;
    for (int i=0;i<a[nod].size();i++) {
        int vecin=a[nod][i];
        if (f[vecin]==0) dfs(vecin);
    }
    sol[++u]=nod;
}

int main() {
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        a[x].push_back(y);
    }
    for (i=1;i<=n;i++) {
        if (f[i]==0) dfs(i);
    }
    for (i=u;i>=1;i--) fout<<sol[i]<<" ";
    return 0;
}