#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

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

const int maxn = 100005;

vector<int> G[maxn];
int intrare[maxn];

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

void SortareTopologica(int n, int m)
{
    queue<int> Q;
    for(int i = 1; i <= n; ++i)
        if(intrare[i] == 0)
            Q.push(i);
    while(!Q.empty())
    {
    int nod = Q.front();
        for(int i = 0; i < G[nod].size(); ++i)
        {
            intrare[G[nod][i]]--;
            if(intrare[G[nod][i]] == 0)
                Q.push(G[nod][i]);
        }
        fout << Q.front() << ' ';
        Q.pop();
    }
    fout << '\n';
}

int main()
{
    int n, m;
    Read(n, m);
    SortareTopologica(n, m);

    fin.close();
    fout.close();
}