#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int i, j, n, m, x, y, k;
int g[50002], s[50002], v[50002];
vector <int> L[50002];
void dfs(int nod){
    v[nod]=1;
    for(int i=0;i<L[nod].size();i++){
        int vecin=L[nod][i];
        if(v[vecin]==0)
            dfs(vecin);
    }
    s[++k]=nod;

}
int main() {
    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>x>>y;
        L[x].push_back(y);
        g[y]++;
    }
    for(i=1;i<=n;i++){
        if(g[i]==0)
            dfs(i);
    }
    for(i=k;i>=1;i--)
        cout<<s[i]<<" ";


}