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

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

// deg[x] = gradul exterior al nodului x
// folosesc o coada Q in care introduc pe rand nodurile care
// au gradul exterior zero
// complexitate O(N+M)

int main(void)
{
    freopen("sortaret.in", "rt", stdin);
    freopen("sortaret.out", "wt", stdout);
	
	// citest date
	int a, b;

    scanf("%d %d\n", &N, &M);
    for(int i = 1; i <= M; i++) {
    	scanf("%d %d\n", &a, &b);
        G[a].push_back(b);
        deg[b]++;
    }
    
    // sortare topologica
    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;
        }
    }

	// scrie rezultat
	for(int i = 1; i <= N; i++)
        printf("%d ", Q[i]);
	
    return 0;
}