#include <iostream>
#include <fstream>
#include <algorithm>
#define NM 50002
using namespace std;

int n, m, a, b, v[NM], t[NM];

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

int fsg (int a, int b )
{
    return (t[a] < t[b]);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        v[i] = i;
    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b;
        t[b]++;
    }
    sort(v + 1, v + n + 1, fsg);
    for(int i = 1; i <= n; i++)
        fout << v[i] << " ";
    return 0;
}