#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#define NMAX 50000

using namespace std;

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

vector<int> v[NMAX];
stack <int> s;
int viz[NMAX];

void sortare_topologica(int i)
{
    viz[i]=1;
    for(auto x:v[i])
        sortare_topologica(x);
    s.push(i);
}

int main()
{
    int n,m;
    f>>n>>m;
    while(m--)
    {
        int x,y;
        f>>x>>y;
        v[x-1].push_back(y-1);
    }
    for(int i=0;i<n;++i)
        if(!viz[i])
            sortare_topologica(i);

    while(!s.empty())
    {
        g<<s.top()+1<<' ';
        s.pop();
    }
    return 0;
}