#include<stdio.h>
#include<vector>
#include <iostream>
#include <queue>
using namespace std;
#define N 100
int grd[N];
vector<int> graf[N];
queue<int> q;

int main()
{
    freopen ("in.in","r",stdin);
    freopen ("out.out","w",stdout);
    int n,m;
    scanf ("%d %d",&n,&m);
    for (int i=0, a, b;i<m;i++)
    {
        scanf ("%d %d", &a, &b);
        graf[a].push_back(b);
        grd[b]++;
    }

    for (int i = 1; i <= n; i++)
        if (grd[i] == 0) q.push(i);




    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        cerr << nod << endl;
        for(int j = 0; j < graf[nod].size(); j++)
            if (--grd[graf[nod][j]] == 0)
            {
                cerr << graf[nod][j] << ' ';
                q.push(graf[nod][j]);
            }
        cerr << endl;
        printf("%d ",nod);
    }
    return 0;
}