#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>

#define NMAX 50005

using namespace std;

vector<int> Graph[NMAX];
bool visited[NMAX];
vector<int> ans;
/*
void dfs(int node) {

    stack<int> s;
    s.push(node);
    visited[node]=true;
    while(!s.empty()) {
        int nodeTop=s.top();
        s.pop();
        for(int vecin : Graph[nodeTop]) {
            if(!visited[vecin]) {
                visited[vecin]=true;
                s.push(vecin);
            }
        }
    }

}
*/
void dfs(int node) {

    visited[node]=true;
    for(int vecin : Graph[node]) {
        if(!visited[vecin])
            dfs(vecin);
    }

    ans.push_back(node);

}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    int numberOfNodes,numberOfEdges;

    scanf("%d %d",&numberOfNodes,&numberOfEdges);

    for(int i=0;i<numberOfEdges;i++) {
        int x,y;
        scanf("%d %d",&x,&y);
        Graph[x].push_back(y);
    }

    for(int i=1;i<=numberOfNodes;i++) {
        if(!visited[i])
            dfs(i);
    }

    for(int i=ans.size()-1;i>=0;i--)
        printf("%d ",ans[i]);

    return 0;
}