#include <fstream>
#include <vector>
#include <queue>
#define maxn 500001

using namespace std;

vector <int> A[maxn];
int Q[maxn];
int grad[maxn],n,m,k=1;

void solve()
{
    int i,j,x;
    for (i=1;i<=n;i++)
        if (grad[i] == 0)
            Q[k++] = i;
    for (i=1;i<=n;i++)
    {
        x = Q[i];
        for (j=0;j<A[x].size();j++)
        {
            grad[A[x][j]]--;
            if (grad[A[x][j]] == 0)
                Q[k++] = A[x][j];
        }
    }

}

int main()
{
    int i,a,b;
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f >> n >> m;
    for (i=1;i<=m;i++)
    {
        f >> a >> b;
        A[a].push_back(b);
        grad[b]++;
    }
    solve();
    for (i=1;i<=n;i++)
        g << Q[i] << " ";
    return 0;
}