#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 50000

using namespace std;

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

vector<int> graph[NMAX];
int topoSort[NMAX];
int maxLen[NMAX];
bool visited[NMAX];
int n, m, k;

void DFS(int node)
{
    visited[node] = 1;
    for(int i = 0; i < graph[node].size(); i++)
        if(!visited[graph[node][i]])
            DFS(graph[node][i]);
    topoSort[k--] = node;
}

int main()
{
    fin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int a, b;
        fin >> a >> b;
        graph[a - 1].push_back(b - 1);
    }
    k = n - 1;

    for(int i = 0; i < n; i++)
        if(!visited[i])
            DFS(i);

    for(int i = 0; i < n; i++)
        fout << topoSort[i] + 1 << ' ';
    return 0;
}