#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 50005;
int n, m;
vector <int> sol;
vector <int> v[NMAX];
bool vf[NMAX];

inline void dfs(int nod)
{
    vf[nod] = true;
    for(auto it : v[nod]) {
        if(!vf[it]) {
            dfs(it);
        }
    }
    sol.push_back(nod);
}

int main()
{
    int a, b, i;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d", &n, &m);
    for(i = 1;i <= m; ++i) {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
    }
    for(i = 1;i <= n; ++i) {
        if(!vf[i]) {
            dfs(i);
        }
    }
    for(i = sol.size() - 1; i >= 0; --i) {
        printf("%d ", sol[i]);
    }
    return 0;
}