#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;

const string file = "sortaret";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647, nmax = 50005;

int n, m;
vector<int> v[nmax], sol;
bool ok[nmax];

void dfs(int x)
{
    ok[x] = 1;
    for (auto y : v[x])
        if(!ok[y])
            dfs(y);
    sol.push_back(x);
}

int main()
{
    ifstream fin (file+".in");
    ofstream fout (file+".out");
    fin >> n >> m;
    for (int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        if(!ok[i])
            dfs(i);
    reverse(sol.begin(), sol.end());
    for (auto x : sol)
        fout << x << " ";
    return 0;
}