#include <iostream>
#include <vector>
#include <stack>
#include <fstream>

using namespace std;

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

vector<int>graph[50005];
stack<int>s;


int n, m, x, y,viz[50005];

void recurs(int x)
{
    viz[x]=1;
    for (auto &v:graph[x])
    {
        if (viz[v]==0)
        {
            recurs(v);
        }
    }
    s.push(x);
}

int main()
{
    f >> n >> m;
    for (int i=0; i<m; i++)
    {
        f >> x >> y;
        graph[x].push_back(y);
    }
    for (int i=1; i<=9; i++)
    {
        if (viz[i]==0)
            recurs(i);
    }
    while (!s.empty())
    {
        g << s.top() <<' ';
        s.pop();
    }
    return 0;
}