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

using namespace std;

#define MAXN 50100

int n, m, deg[MAXN], Q[MAXN];
vector<int> G[MAXN];

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


int main()
{
    f>>n>>m;

    int a,b;
    for(int i=1;i<=m;i++)
        f>>a>>b, G[a].push_back(b), deg[b]++;

    int x;
    vector<int>::iterator it;

    for( x = 1; x <= n; x++)
     if(deg[x] == 0) Q[++Q[0]] = x;

    for(int 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;
        }
    }


    for(int i=1; i<=n; i++)
        g<<Q[i]<<" ";
}