#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

int n, m;
bool viz[50000];
vector<int> g[50000];
vector<int> r;

void citire()
{
    FILE* f = fopen("sortaret.in", "r");

    fscanf(f, "%d%d", &n, &m);

    for (int i = 0; i < m; ++i)
    {
        int x, y;
        fscanf(f, "%d%d", &x, &y);
        g[x].push_back(y);
    }

    fclose(f); 
}

void toposort(int x)
{
    queue<int> q;
    
    q.push(x);

    while(!q.empty())
    {
        int c = q.front();
        q.pop();

        if (!viz[c])
        {
            viz[c] = true;
            r.push_back(c);
            for (int i = 0; i < g[c].size(); ++i)
            {
               q.push(g[c][i]);
            }
        }
    }
}

void afisare()
{
    FILE* f = fopen("sortaret.out", "w");
    for (int i = 0; i < r.size(); ++i)
        fprintf(f, "%d ", r[i]);
    fclose(f);
}

int main()
{
    citire();
    for (int i = 1; i <= n; ++i)
        if (!viz[i])
            toposort(i);
    afisare();

    return 0;
}