#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int NMAX = 50015;

vector<int> v[NMAX];
vector <int> sol;

int n,m;
bool viz[NMAX];


void citire()
{
    in>>n>>m;

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

}

void dfs(int node)
{
    viz[node] = 1;
    for(int i=0;i<v[node].size();i++)
    {
        if(viz[v[node][i]]==0)
        {
            dfs(v[node][i]);
        }
    }
    sol.push_back(node);
}


int main()
{
    citire();

    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
        }
    }

    for(int i = sol.size()-1;i>=0;i--)
    {
        out<<sol[i]<<" ";
    }

}