#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

#define MAXN 50100
#define pb push_back

	
int N, M, deg[MAXN], Q[MAXN]; vector<int> G[MAXN];


void solveGraph(){
    int i, x; vector<int>::iterator it;
    
    for(x = 1; x <= N; x++)
     if(deg[x] == 0) Q[++Q[0]] = x;
 
    for(i = 1; i <= N; i++)
    {
        x = Q[i];
        for(it = G[x].begin(); it != G[x].end(); ++it)
        {
            deg[*it]--;
            if(deg[*it] == 0) Q[++Q[0]] = *it;
        }
    }
}

void readData(){
    scanf("%d %d\n", &N, &M);
    int a, b;
    for(int i = 0; i < M; i++){
        scanf("%d %d", &a, &b), G[a].pb(b), deg[b]++;
    }
}

	
void writeData()
{
    int i;
 
    for(i = 1; i <= N; i++)
        printf("%d ", Q[i]);
}

int main(){
    
    freopen("sortaret.in", "rt", stdin);
    freopen("sortaret.out", "wt", stdout);
 
    readData();
    solveGraph();
    writeData();

    return 0;

}