#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50001

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> v[NMAX];
queue <int> s;
int viz[NMAX];

void DFS(int i)
{
    viz[i]=1;
    for(size_t k = 1; k < v[i].size(); k++)
        if(!viz[k]) DFS(k);
    s.push(i);
}

int main()
{
    int n,m;
    f>>n>>m;
    while(m--)
    {
        int x,y;
        f>>x>>y;
        v[x-1].push_back(y-1);
    }
    for(int i = 1;i <= n;i++)
        if(!viz[i])
            DFS(i);
    for(int i = 0; i < s.size(); i++)
    {
        g<<s.front()<<' ';
    }
}