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

using namespace std;

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

const int N = 50001;

int n, m;
bool viz[N];
vector <int> v[N];
vector <int> q;

void dfs(int x)
{
    viz[x] = 1;
    for(auto y:v[x])
    {
        if(!viz[y])
        {
            dfs(y);
        }
    }
    q.push_back(x);
}

int main()
{
    in>>n>>m;
    for(int i=0; i<m; i++)
    {
        int x,y;
        in>>x>>y;
        v[x].push_back(y);

    }
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    for(int i = n-1; i>=0; i--)
    {
        out << q[i] <<" ";
    }
    return 0;
}