#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
//#include "PEZai.h"
//#include <Tlhelp32.h>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
using namespace std;
int y[50004];
vector<int> a[50004], sol;
void depth(int nod, vector<int> a[], int n)
{
    int ok = 0;
    if(a[nod].size() == 0)
    {
        y[nod] = 1;
        sol.push_back(nod);
        return ;
    }
    for(int i = 0; i < a[nod].size(); i++)
    {
        if(y[a[nod][i]] != 1){
            ok = 1;
            depth(a[nod][i], a, n);
        }
    }
    y[nod] = 1;
    sol.push_back(nod);
}
int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int aa, bb;
        cin >> aa >> bb;
        a[aa].push_back(bb);
    }
    for(int i = 1; i <= n; i++){
        if(y[i] == 0)
            depth(i, a, n);
        if(sol.size() == n){
        for(int i = sol.size() - 1; i >= 0; i--)
            cout << sol[i] << " ";
        exit(0);
        }
    }
}