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

using namespace std;

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

const int NMAX = 50000;
const int MMAX = 100000;

vector <int> graf[NMAX + 1];
int grad[NMAX + 1];
queue <int> q;

void sortare()
{
    while(!q.empty())
    {
        int nod = q.front();
        out << nod << ' ';
        q.pop();

        for (int i = 0; i < graf[nod].size(); i++)
        {
            int vecin = graf[nod][i];
            grad[vecin]--;
            if (grad[vecin] == 0)
            {
                q.push(vecin);
            }
        }
    }
}


int main()
{
    int n, m, x, y;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        in >> x >> y;
        graf[x].push_back(y);
        grad[y]++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (grad[i] == 0)
        {
            q.push(i);
        }
    }
    sortare();
}