#include<iostream>
#include<algorithm>
#include<fstream>
#include<bitset>
#include<vector>
#define Nmax 50001
using namespace std;

void read_data(int &N, int &M, vector<int> G[])
{
    ifstream f("sortaret.in");
    f>>N>>M;

    for(int i = 0; i < M; ++i)
    {
        int x, y;
        f>>x>>y;
        G[x].push_back(y);
    }

    f.close();
}

void dfs(int node, vector<int> &sol, bitset<Nmax> &viz, vector<int> G[])
{
    viz[node] = 1;
    for(auto it = G[node].begin(); it != G[node].end(); ++it)
        if(viz[*it] == false)
            dfs(*it, sol, viz, G);

    sol.push_back(node);
}
void write_data(vector<int> &sol)
{
    ofstream g("sortaret.out");
    for(auto it = sol.begin(); it != sol.end(); ++it)
        g<<*it<<" ";

    g.close();
}
int main()
{
    vector<int> G[Nmax];
    int N, M;

    read_data(N, M, G);

    bitset<Nmax> viz;
    viz.reset();

    vector<int> sol;
    vector<int> part_sol;
    for(int i=1;i<=N;++i)
    {
        part_sol.clear();
        if(!viz[i])
            dfs(i, part_sol, viz, G);

        reverse(part_sol.begin(), part_sol.end());
        sol.insert(sol.begin(), part_sol.begin(), part_sol.end());
    }

    write_data(sol);
    return 0;
}