#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 550
#define M 2200
#define ll long long
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=gc();
return x*f;
}
int num=1,n,m,T,a[N],st[M],ed[M],h[N],level[N],cur[N];ll ans1,ans2;int bin[N];
struct node{
int y,z,next;
}data[20000];
inline void insert1(int x,int y,int z){
data[++num].y=y;data[num].z=z;data[num].next=h[x];h[x]=num;
data[++num].y=x;data[num].z=0;data[num].next=h[y];h[y]=num;
}
inline void insert1(int x,int y,int z1,int z2){
data[++num].y=y;data[num].z=z1;data[num].next=h[x];h[x]=num;
data[++num].y=x;data[num].z=z2;data[num].next=h[y];h[y]=num;
}
inline bool bfs(){
memset(level,0,sizeof(level));level[0]=1;queue<int>q;q.push(0);
while(!q.empty()){
int x=q.front();q.pop();
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[y]||!z) continue;level[y]=level[x]+1;q.push(y);if (y==T) return 1;
}
}return 0;
}
inline int dfs(int x,int s){
if (x==T) return s;int ss=s;
for (int &i=cur[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[x]+1==level[y]&&z){
int xx=dfs(y,min(z,s));if (!xx) level[y]=0;
s-=xx;data[i].z-=xx;data[i^1].z+=xx;if(!s) return ss;
}
}return ss-s;
}
inline void gao(int x){
memset(h,0,sizeof(h));num=1;int ans=0;
for (int i=1;i<=m;++i) insert1(st[i],ed[i],10000,10000);
for (int i=1;i<=n;++i){
if (a[i]<0) {insert1(0,i,1);continue;}
if (a[i]&x) insert1(i,T,inf),insert1(0,i,1);else insert1(0,i,inf);
}while(bfs()) memcpy(cur,h,sizeof(h)),ans+=dfs(0,inf);
ans1+=(ll)ans/10000*x;ans2+=(ll)ans%10000*x;
}
int main(){
freopen("bzoj2400.in","r",stdin);
n=read();m=read();int max1=0;T=n+1;
for (int i=1;i<=n;++i) a[i]=read(),max1=max(max1,a[i]);
for (int i=1;i<=m;++i) st[i]=read(),ed[i]=read();
for (int i=0;i<=31;++i) bin[i]=1<<i;
for (int i=0;i<=31;++i){if (bin[i]>max1) break;gao(bin[i]);}
printf("%lld\n%lld",ans1,ans2);
return 0;
}