#include <cstdio>
#include <vector>
#include <queue>

using namespace std;
const int NMAX=50005;
vector <int> g[NMAX];
bool viz[NMAX];
int deg[NMAX];
int top[NMAX];
queue <int> q;
int n, m, cc;

void sortare_topologica()
{
    int a, t=n;
    for(int i=1; i<=n; i++)
    {
        if(deg[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        a=q.front();
        q.pop();
        printf("%d ", a);
        top[t]=a;
        t--;
        for(int i=0; i<g[a].size(); i++)
        {
            deg[g[a][i]]--;
            if (deg[g[a][i]]==0)
                q.push(g[a][i]);
        }
    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int u, v, cc, i;
    scanf("%d%d", &n, &m);
    for(i=1; i<=m; i++)
    {
        scanf("%d%d", &u, &v);
        g[u].push_back(v);
        deg[v]++;
    }
    sortare_topologica();
    return 0;
}