#include <fstream>
#include <vector>
#define in "sortaret.in"
#define out "sortaret.out"
#define N 50003

using namespace std;

ifstream fin(in);
ofstream fout(out);

vector<int> v[N];

int n,m,x,y;
bool f[N];
int grint[N];

inline void DFS(int nod)
{
    fout<<nod<<" ";
    vector<int>::iterator it;
    for(it = v[nod].begin(); it != v[nod].end(); ++it)
        --grint[*it];
    for(it = v[nod].begin(); it != v[nod].end(); ++it)
        if(!f[*it] && grint[*it] == 0)
        {
            f[*it] = 1;
            DFS(*it);
        }

}

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

    while(m--)
    {
        fin>>x>>y;
        v[x].push_back(y);
        ++grint[y];
    }

    for(int i=1; i<=n; ++i)
        if(!f[i] && !grint[i])
            DFS(i);

    fin.close(); fout.close();
    return 0;
}