#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, init, n) for (int i = init; i < (n); i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

vector<int> graph[20];

int main()
{
    int M, N;
    cin >> M >> N;

    rep(i, N)
    {
        int x, y;
        cin >> x >> y;

        x--;
        y--;

        graph[x].push_back(y);
    }

    vector<int> indeg(M);
    stack<int> s;

    for (auto edges : graph)
        for (auto v : edges)
            indeg[v]++;

    rep(i, M) if(indeg[i] == 0) s.push(i);

    vector<int> ans;

    while(s.size() > 0)
    {
        int u = s.top();
        s.pop();

        ans.emplace_back(u);

        for(auto v : graph[u])
        {
            indeg[v]--;
            if(indeg[v] == 0) s.push(v);
        }
    }

    rep(i, M) cout << ans[i] + 1 << endl;

    return 0;
}
