#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, m;
    vector<int> node_val(n + 1);
    vector<vector<int>> edges(n + 1);
    vector<int> in_edges(n + 1, 0), prev(n + 1, -1);
    vector<int> memo(n + 1, -1);

    cin >> n >> m;

    for (int i=1; i <= n; i++) {
        cin >> node_val[i];
        memo[i] = node_val[i];
    }

    for (int i=0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        edges[u].push_back(v);
        in_edges[v]++;
    }

    queue<int> q;
    for (int i=1; i <= n; i++) {
        if (in_edges[i] == 0) {
            q.push(i);
        }
    }

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

        for (int next : edges[node]) {
            if (memo[next] < memo[node] + node_val[next]) {
                memo[next] = memo[node] + node_val[next];
                prev[next] = node;
            }
            if (--in_edges[next] == 0) {
                q.push(next);
            }
        }
    }

    int idx = 0;
    for (int i=1; i <= n; i++) {
        if (memo[i] > memo[idx]) {
            idx = i;
        }
    }
    int sum = memo[idx];
    vector<int> ans;

    while (idx > 0) {
        ans.push_back(idx);
        idx = prev[idx];
    }

    cout << sum << '\n';

    for (int i = ans.size() - 1; i >= 0; i--) {
        cout << ans[i] << ' ';
    }

    return 0;
}