#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 50010
using namespace std;
int n,m,i,j,x,y,nr;
vector <int> g[nmax],sol;
bitset <nmax> fr;
void dfs(int nod)
{
    int i; fr[nod]=1;
    for (i=0;i<g[nod].size();i++)
        if (fr[g[nod][i]]==0) 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 (i=1;i<=m;i++) {
    scanf("%d %d",&x,&y);
    g[x].push_back(y);
}
for (i=n;i>=1;i--)
    if (fr[i]==0) dfs(i);
for (i=sol.size()-1;i>=0;i--) printf("%d ",sol[i]);
return 0;
}