#include <bits/stdc++.h>

#define NMax 50005

using namespace std;

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

int N,M;
vector<int> G[NMax];
bool visited[NMax];
stack<int> sol;

void DFS(int node)
{
    visited[node]=true;
    for(auto child : G[node])
        if(!visited[child])
            DFS(child);
    sol.push(node);
}

int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }

    for(int i=1;i<=N;i++)
        if(!visited[i])
            DFS(i);

    for(;!sol.empty();sol.pop())
        fout<<sol.top()<<" ";

    return 0;
}