#include <fstream>
#include <queue>
#include <vector>
using namespace std;

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

queue<int> q;
vector <int> s[50001];
int nrp[50001];

int main()
{int n,m;
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        in>>x>>y;
        s[x].push_back(y);
        nrp[y]++;
    }
    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:s[x])
        {
            nrp[y]--;
            if(nrp[y]==0)
            {
                q.push(y);
            }
        }
    }
    return 0;
}