#include<iostream>
#include<fstream>
#include<cstring>
#include<bits/stdc++.h>
#include<iomanip>
#define DMAX 2000002
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
	
class Graph{
    int V;
    list<int> *adj;
    void topSortUtil(int v, bool visited[], stack<int>& Stack);
    
    public:
        Graph(int V);
        void addEdge(int v, int w);
        void DFS(int v);
        void topSort();
};

Graph::Graph(int V)
{
    this->V = V;
    adj = new list<int>[V];
}

void Graph::addEdge(int v,int w)
{
    adj[v].push_back(w);
}

void Graph::topSortUtil(int v, bool visited[], stack<int>& Stack)
{
    visited[v] = true;

    for(int i=0;i<adj[v].size();i++)
        if (!visited[i])
            topSortUtil(i, visited, Stack);
 
    Stack.push(v);
}

void Graph::topSort()
{
    stack<int> Stack;
    bool *visited = new bool[V];

    for(int i=0;i<V;i++)
        visited[i] = false;

    for(int i=0;i<V;i++)
    {
        if(visited[i] == false)
            topSortUtil(i, visited, Stack);
    }

    while(!Stack.empty())
    {
        fout<<Stack.top()+1<<" ";
        Stack.pop();
    }
}

int main()	
{
    ios::sync_with_stdio(0);
    fin.tie(0); 
    int n,m;
    fin>>n>>m;
    Graph a(n);
    int x,y;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;  
        a.addEdge(x,y);      
    }
    a.topSort();
    fout.tie(0);
    fin.close();
    fout.close();
    return 0;
}