#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50000

using namespace std;
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
int n, m;
int dint[NMAX+5];
vector <int> OUT[NMAX+5], V;
queue <int> Q;

void citire(void)
{
    int x, y;
    fi>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fi>>x>>y;
        OUT[x].push_back(y);
        dint[y]++;
    }
}

void topSort(void)
{
    int nod, nods;
    for(int i=1; i<=n; i++)
    {
        if(dint[i]==0)
        {
            Q.push(i);
            V.push_back(i);
        }
    }
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(int i=0; i<OUT[nod].size(); i++)
        {
            nods=OUT[nod][i];
            dint[nods]--;
            if(dint[nods]==0)
            {
                Q.push(nods);
                V.push_back(nods);
            }
        }
        OUT[nod].clear();
    }
}

void afisare(void)
{
    for(int i=0; i<V.size(); i++)
        fo<<V[i]<<" ";
}

int main()
{
    citire();
    topSort();
    afisare();
    fi.close();
    fo.close();
    return 0;
}