#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

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

vector <int> mu[100005];
int vis[100005];
vector<int> sorted;

void dfs(int nod){
    vis[nod]=1;
    for(int i=0;i<mu[nod].size();i++)
        if(vis[mu[nod][i]]==0)
            dfs(mu[nod][i]);
    sorted.push_back(nod);
}

int main()
{
    int n,m,nrcomp=0,a,b;
    in>>n>>m;
    for(int i=1;i<=m;i++){
        in>>a>>b;
        mu[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(vis[i]==0)
        {
            dfs(i);
            ++nrcomp;
        }
    for(int i=n-1;i>=0;i--){
		out<<sorted[i]<<" ";
	}
    return 0;
}