#include <fstream>

using namespace std;

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

vector<int> a[35000];
int nrp[35000];
int main()
{
    in >> n >> m;
    for(int i = 0;i < m;i ++)
    {
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
        nrp[y] ++;
    }

    queue<int> q;
    for(int i = 1;i <= n;i ++)
    {
        if(nrp[i] == 0)
            q.push(i);
    }

    while(!q.empty())
    {
        int x= q.front();
        out<< x << " ";
        q.pop();
        for(auto y: a[x])
        {
            nrp[y]--;
            if(nrp[y] == 0)
                q.push(y);
        }
    }
    return 0;
}