#include <vector>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m;

vector <int> graph [1000];
queue <int> q;
int viz[1000], grad[1000];

void dfs (int node)
{
    viz[node] = 1;
    int dim = graph[node].size(); //nr vecini nod
    for(int i=0; i<dim; i++)
    {
        int vecin = graph[node][i];
        if(!viz[vecin])
            dfs(vecin);
    }
}

int main ()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
            dfs[i];
    }

    for(int i=1; i<=m; i++)
    {
        int x, y; //arc (x,y)
        f>>x>>y;
        grad[x]++;
        graph[y].push_back(x); //graf transpus
    }

    for(int i=1; i<=n; i++)
    {
        if(grad[i] == 0) //pun in coada nodurile cu grad 0
            q.push(i);
    }

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        g<<nod<<" ";
        for(int i=0; i<graph[nod].size(); i++)
        {
            int vecin = graph[nod][i];
            grad[vecin]--;
            if(grad[vecin] == 0)
                q.push(vecin);
        }
    }
}