#include <fstream>
#include <vector>
#include <queue>
#include <functional>
#define NMAX 1000
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int d[NMAX];
int n,m;

vector <int> g[NMAX];
queue <int> c;

void citire();
void sortop();

int main()
{
    citire();
    sortop();
    return 0;
}
void citire()
{
    int i,x,y;
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        d[y]++;
        g[x].push_back(y);
    }
}
void sortop()
{
    int i,x,j;
    for (i=1;i<=n;i++)
        if(!d[i])
            c.push(i);
    while (!c.empty())
    {
        x=c.front();
        c.pop();
        fout<<x<<" ";
        for (j=0;j<g[x].size();j++)
            if (d[g[x][j]]>0)
            {
                d[g[x][j]]--;
                if (!d[g[x][j]]) c.push(g[x][j]);
            }
    }
    fout<<'\n';
}