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

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

int gradintern[50001],n,m;
vector<int>g[50001];
queue<int>q;

int main()
{
    cin>>m>>n;

    for(int i=1;i<=n;i++)
    {
        int a,b;
        cin>>a>>b;
        g[a].push_back(b);
        gradintern[b]++;
    }

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

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        cout<<nod<<" ";
        for(auto vecin:g[nod])
        {
            gradintern[vecin]--;
            if(gradintern[vecin] == 0)
                q.push(vecin);
        }

    }

    return 0;
}