#include <bits/stdc++.h>

#define rep_(v, f, l) for (int v = (f); v < (l); ++v)
#define rep(v, n) rep_(v, 0, n)
#define lep(v, n) rep_(v, 1, n + 1)

using namespace std;

typedef long long int lint;

static inline int in(){ int x; scanf("%d", &x); return x; }
static inline lint inl(){ lint x; scanf("%lld", &x); return x; }

int main()
{
    int m, n;
    int is_before[32][32] = {};

    m = in();
    n = in();
    rep(i, n){
        int x, y;
        x = in() - 1;
        y = in() - 1;
        is_before[x][y] = 1;
    }

    int ranking[32] = {};
    rep(i, m){
        rep(j, m){
            if (is_before[i][j]){
                ranking[j]++;
            }
        }
    }
    rep(i, m + 1){
        rep(j, m){
            if (ranking[j] == i) printf("%d\n", j + 1);
        }
    }
    return (0);
}