#include <fstream>
#include <time.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define pb push_back
#define mp make_pair
#define sortvi(a) sort(a.begin(), a.end())
#define FOR(i, start, final) for (int i=start; i<=final; ++i)
#define ROF(i, start, final) for (int i=start; i>=final; --i)

#define MAXNODES 50005

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair < int, int> pi;
typedef vector< int > vi;
typedef vector< pair< int, int > > vpi;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int N, M;
vi G[MAXNODES], topoSorted;
bitset < MAXNODES > viz;

void dfs(int node) {
    viz[node] = 1;
    for (auto it : G[node]) {
        if (!viz[it]) {
            dfs(it);
        }
    }
    topoSorted.pb(node);
}

int main()
{
    f.sync_with_stdio(false);
    f>>N>>M;

    FOR(i,1,M) {
        int x, y;
        f>>x>>y;
        G[x].pb(y);
    }

    FOR(i,1,N) {
        if (!viz[i]) {
            dfs(i);
        }
    }

    for (int i = 0; i < topoSorted.size(); ++i) {
        g<<topoSorted[i]<<' ';
    }
    return 0;
}