#include<fstream>
#include<vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,i,x,y,nod,k;
int s[100001],v[100001],f[100010];

vector<int> vecin[100010];

void dfs(int nod){
    v[nod]=1;
    for(int i = 0; i<vecin[nod].size(); i++){
        int vec = vecin[nod][i];
        if(v[ vec ]==0)
            dfs( vec );
    }
    s[++k]=nod;
}

int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        vecin[x].push_back(y);
        f[y]++;
    }

    for (i=1;i<=n;i++)
        if (f[i] == 0)
            dfs(i);
    for(i=k;i>=1;i--)
        fout<<s[i]<<" ";
    return 0;
}