#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>

#define NMax 50005
#define INF 0x3f3f3f3f
using namespace std;
int n,m,x,y;
int viz[NMax];
vector<int> G[NMax];
vector<int> sol;

void dfs(int nod){
    viz[nod] = 1;
    for(int i = 0; i < G[nod].size(); ++i)
        if(!viz[G[nod][i]])
            dfs(G[nod][i]);
    sol.push_back(nod);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; ++i){
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(!viz[i])
            dfs(i);
    for(int i = sol.size() - 1; i >= 0; --i){
        printf("%d ",sol[i]);
    }
    return 0;
}