#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N=100000;
vector <int> a[N];
queue <int> q;
int n,m,v[5001],nrp[5000],nr=0;

void citire()
{
    int x, y;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
        //a[y].push_back(x);
    }
}

void sortare()
{
    int i,x,y;
    for(i=1;i<=n;i++)
        if(nrp[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        v[++nr]=x;
        for(size_t i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            nrp[y]--;
            if(nrp[y]==0)
                q.push(y);
        }
    }
}

int main()
{
    citire();
    sortare();
    int i;
    for(i=1;i<=n;i++)
        out<<v[i]<<" ";
    return 0;
}