///sortare topologica in adancime
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N=50001;

int n;
vector<int> a[N];
vector<int> srtt;
bool viz[N];

void dfs_sortaret(int x)
{
    viz[x]=1;
    for(auto y: a[x])
    {
        if(!viz[y])
            dfs_sortaret(y);
    }
    srtt.push_back(x);
}

int main()
{
    int x, y, m;
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
        {
            dfs_sortaret(i);
        }
    }
    for(int i=n-1; i>=0; i--)
        out<<srtt[i]<<' ';
    return 0;
}


///sortare topologica
/*
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N=50001;

int n, nrp[N];
vector<int> a[N];
queue<int> q;

void sortaret()
{
    for(int i=1; i<=n; i++)
    {
        if(nrp[i]==0)
            q.push(i);
    }
    int x;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        out<<x<<' ';
        for(auto y: a[x])
        {
            nrp[y]--;
            if(nrp[y]==0)
                q.push(y);
        }
    }
}

int main()
{
    int x, y, m;
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }
    sortaret();
    return 0;
}
*/