#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mid (l + ((r - l) / 2))
#define F first
#define S second
int64_t n, m ;
vector<int64_t> a(2e5 + 5), lg(2e5 + 5), pr(2e5 + 5) ;
vector<vector<int64_t>> adj(2e5 + 5) ;
vector<vector<int64_t>> sp(20 , vector<int64_t>(2e5 + 5)) ;
vector<bool> an(2e5 + 5) ;
void rec(int64_t par , int64_t l , int64_t r)
{
if(l > r) return ;
int64_t x = sp[lg[r - l + 1]][l], y = sp[lg[r - l + 1]][r - (1 << lg[r - l + 1]) + 1], p = (a[x] >= a[y] ? x : y) ;
if(par == -1 || (an[par] && pr[r] - pr[l - 1] >= a[par])) an[p] = 1 ;
rec(p , l , p - 1), rec(p , p + 1 , r) ;
return ;
}
void solve()
{
cin >> n >> m ;
for(int64_t i = 1 ; i <= n ; i++) cin >> a[i] ;
for(int64_t i = 1 ; i <= m ; i++)
{
int64_t x, y ;
cin >> x >> y ;
adj[x].pb(y), adj[y].pb(x) ;
}
for(int64_t i = 0 ; i < 20 ; i++)
{
for(int64_t j = 1 ; j <= n ; j++)
{
if(i == 0) sp[i][j] = j ;
else
{
int64_t x = sp[i - 1][j], y = sp[i - 1][j + (1 << (i - 1))] ;
sp[i][j] = (a[x] >= a[y] ? x : y) ;
}
}
}
for(int64_t i = 1 ; i <= n ; i++) lg[i] = (i == 1 ? 0 : lg[i / 2] + 1), pr[i] = pr[i - 1] + a[i] ;
rec(-1 , 1 , n) ;
for(int64_t i = 1 ; i <= n ; i++) cout << an[i] ;
cout << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt = 1 ;
//cin >> tt;
while (tt--) solve() ;
}
