#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define MAX 50010

vector <int> G[MAX];
stack <int> stiva;

int a[MAX];


int main()
{
    int n, m, i, x, y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        a[y]++;
    }

    for(i=1;i<=n;i++)
    {
        if(a[i]==0)
        {
            stiva.push(i);
        }
    }

    while(!stiva.empty())
    {
        x=stiva.top();
        stiva.pop();
        fout<<x<<" ";
        for(i=0;i<G[x].size();i++)
        {
            a[G[x][i]]--;
            if(a[G[x][i]]<=0)
                stiva.push(G[x][i]);
        }
    }

    return 0;
}