#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <bitset>
using namespace std;

int n,m1;
vector<int> m[50003];
bitset<50003> viz;
stack<int> s;

void solve(int nod)
{
    viz[nod]=1;
    for(vector<int>::iterator it=m[nod].begin();it<m[nod].end();it++)
        if(!viz[*it]) solve(*it);
    s.push(nod);
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m1);
    int i,n1,n2;
    for(i=1;i<=m1;i++)
    {
        scanf("%d%d",&n1,&n2);
        m[n1].push_back(n2);
    }
    for(i=1;i<=n;i++)
        if(!viz[i]) solve(i);
    while(!s.empty())
    {
        printf("%d ",s.top());
        s.pop();
    }
}