#include <bits/stdc++.h> using namespace std; #define int long long int N; int f(vector<int> S,vector<vector<int>> &G){ vector<int> A(N,-1),B(N,-1); A[0] = 0; for(int i=0;i<N;i++){ for(int x:G[i]){ if(x < i) continue; if(A[i] != -1){ if(S[x] < S[i]) A[x] = max(A[x],A[i]); else B[x] = max(B[x],A[i]+S[x]-S[i]); } if(B[i] != -1){ if(S[x] < S[i]) A[x] = max(A[x],B[i]); } } } return max(A[N-1],B[N-1]); } int g(vector<int> S,vector<vector<int>> &G){ vector<int> A(N,-1),B(N,-1); A[N-1] = 0; for(int i=N-1;i>=0;i--){ for(int x:G[i]){ if(x > i) continue; if(A[i] != -1){ if(S[x] < S[i]) A[x] = max(A[x],A[i]); else B[x] = max(B[x],A[i]+S[x]-S[i]); } if(B[i] != -1){ if(S[x] < S[i]) A[x] = max(A[x],B[i]); } } } return max(A[0],B[0]); } signed main(){ int M; cin>>N>>M; vector<int> S(N); for(int i=0;i<N;i++) cin>>S[i]; vector<vector<int>> G(N); for(int i=0;i<M;i++){ int a,b; cin>>a>>b; G[a-1].push_back(b-1); G[b-1].push_back(a-1); } cout<<f(S,G)<<endl;cout<<g(S,G)<<endl; }