#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m;cin>>n>>m;
  vl H(n);rep(i,0,n)cin>>H[i];
  vvl G1(n),G2(n);
  while(m--){
    ll x,y;cin>>x>>y;
    x--;y--;
    G1[x].push_back(y);
    G2[y].push_back(x);
  }
  vvl dp1(n,vl(2,-infl)),dp2(n,vl(2,-infl));
  dp1[0][0]=0;dp2[n-1][0]=0;
  rep(i,0,n){
    for(ll j:G1[i]){
      if(H[j]>H[i]){
        dp1[j][1]=max(dp1[j][1],dp1[i][0]+H[j]-H[i]);
      }else{
        dp1[j][0]=max(dp1[j][0],max(dp1[i][0],dp1[i][1]));
      }
    }
  }
  for(ll i=n-1;i>=0;i--){
    for(ll j:G2[i]){
      if(H[j]>H[i]){
        dp2[j][1]=max(dp2[j][1],dp2[i][0]+H[j]-H[i]);
      }else{
        dp2[j][0]=max(dp2[j][0],max(dp2[i][0],dp2[i][1]));
      }
    }
  }
  cout<<max(0LL-1,max(dp1[n-1][0],dp1[n-1][1]))<<el;
  cout<<max(0LL-1,max(dp2[0][0],dp2[0][1]))<<el;
}