#include <fstream>
#include <vector>
#include <bitset>
#define dim 50010
using namespace std;

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

int n,m,i,j,d[dim],cnt;
vector <int> l[dim];
bitset <dim> f,g;

void dfs(int nod){
    f[nod]=1;

    for(int i=0;i<l[nod].size();i++){
        int vec=l[nod][i];

        if(!f[vec])
            dfs(vec);
    }

    d[++cnt]=nod;
}

int main(){
    fin>>n>>m;

    for(;m;m--){
        fin>>i>>j;
        l[i].push_back(j);
        g[j]=1;
    }

    for(i=1;i<=n;i++)
        if(!g[i])
            dfs(i);

    while(cnt)
        fout<<d[cnt--]<<" ";

    return 0;
}