#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

typedef long long LL;
typedef vector<int> vi;
typedef vector< vi > vii;
typedef vector<string> vs;
typedef vector<double> vd;
typedef pair<int, int> ii;
#define PB push_back
#define SZ(v) v.size()
#define ALL(v) (v).begin(), (v).end()
#define FORIT(i,c) for (typeof((c).end()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i,n) for (int i = 0; i<(n); ++i)
#define FORE(i,n) for (int i = 0; i<=(n); ++i)
#define FORI(i,n1,n2) for (int i = n1; i<(n2); ++i)
#define FORIE(i,n1,n2) for (int i = n1; i<=(n2); ++i)
#define FORV(i,v) for (unsigned int i = 0; i<SZ(v); ++i)

#define INF 0x3f3f3f3f
#define EPS 1e-9

#define NMAX 50001
#define MMAX 100000

int N,M;
vi G[NMAX];
int gr[NMAX];

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d %d", &N, &M);

    FOR(i,M)
    {
        int x,y;
        scanf("%d %d", &x, &y);
        G[x].PB(y);
        ++gr[y];
    }

    queue<int> Q[2];

    FORIE(i,1,N)
        if (!gr[i])
            Q[0].push(i);

    int cur = 0, nex = 1;
    while (!Q[cur].empty())
    {
        while (!Q[cur].empty())
        {
            int node = Q[cur].front();
            Q[cur].pop();

            printf("%d ", node);

            FORV(i,G[node])
            {
                int next = G[node][i];
                --gr[next];
                if (!gr[next])
                    Q[nex].push(next);
            }
        }

        swap(cur, nex);
    }

    return 0;
}