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

using namespace std;

vector<int> top_sort(const vector<vector<int>>& graph)
{
    int n = graph.size() - 1;
    vector<int> d(n + 1, 0);
    for(int i = 1; i <= n; i++)
    {
        for(int neigh: graph[i]) {
            d[neigh]++;
        }
    }
    
    vector<int> result;
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        if(d[i] == 0) {
            q.push(i);
        }
    }
    
    while(!q.empty())
    {
        int node = q.front();
        result.push_back(node);
        q.pop();
        
        for(int neigh: graph[node]) {
            d[neigh]--;
            
            if(d[neigh] == 0) {
                q.push(neigh);
            }
        }
    }
    
    return result;
}

int main() 
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    
    int n, m;
    
    fin >> n >> m;
    
    vector<vector<int>> graph(n + 1);
    
    for(int i = 0; i < m; i++) {
        int a, b;
        fin >> a >> b;
        graph[a].push_back(b);
    }
    
    vector<int> result = top_sort(graph);
    
    for(int i = 0; i < n; i++) {
        fout << result[i] << ' ';
    }
    
    return 0;
}