#include<bits/stdc++.h>using namespace std;int a[300],b[300],n,k;
bool cmp(int a,int b)
{return a>b;
}
int main()
{//freopen("t.txt","r",stdin);scanf("%d%d",&n,&k);for(int i=0;i<n;i++)  scanf("%d",&a[i]);for(int i=0;i<k;i++)  scanf("%d",&b[i]);sort(b,b+k,cmp );for(int i=0,j=0;i<n&&j<k;i++){if(a[i]==0)a[i]=b[j++];}for(int i=1;i<n;i++)if(a[i]<=a[i-1]){printf("YES\n");return 0;}printf("NO\n");return 0;
}

#include<bits/stdc++.h>using namespace std;
const int N=2000;
int a[N],b[N],ans[N],color[N],n,vis[N];int main()
{//freopen("t.txt","r",stdin);scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&a[i]);for(int i=0;i<n;i++)scanf("%d",&b[i]);int sum=0;vector<int>ad;ad.clear();for(int i=0;i<n;i++)if(a[i]==b[i])ans[i]=a[i],sum++,color[a[i]]++;else  ad.push_back(i);vector<int>numa;numa.clear();for(int i=1;i<=n;i++)if(color[i]==0)numa.push_back(i);if(sum==n-1){ans[ad[0]]=numa[(int)(numa.size()-1)];}else{if((a[ad[0]]==numa[0]&&b[ad[1]]==numa[1])||(b[ad[0]]==numa[0]&&a[ad[1]]==numa[1])){ans[ad[0]]=numa[0];ans[ad[1]]=numa[1];}else{ans[ad[1]]=numa[0];ans[ad[0]]=numa[1];}}for(int i=0;i<n-1;i++)printf("%d ",ans[i]);printf("%d\n",ans[n-1]);return 0;
}

#include<bits/stdc++.h>using namespace std;int dp[26][1510][1510],maxx[26][1510],ti[26][1510],n,q;
char ss[1510];
int main()
{//freopen("t.txt","r",stdin);scanf("%d",&n);scanf("%s",&ss);for(int i=0;i<26;i++)for(int j=0;j<n;j++){int k=j;while(k<n&&ss[k]==char(i+'a'))ti[i][j]++,k++;}for(int i=0;i<26;i++){for(int j=0;j<n;j++){for(int k=1;j+k<=n;k++){if(dp[i][j][k-1]>=n){dp[i][j][k]=n;maxx[i][k]=max(maxx[i][k],dp[i][j][k]);continue;}dp[i][j][k]=dp[i][j][k-1]+ti[i][min(n,j+dp[i][j][k-1])]+1+ti[i][min(n,j+dp[i][j][k-1]+ti[i][j+dp[i][j][k-1]]+1)];if(dp[i][j][k]>n)dp[i][j][k]=n;maxx[i][k]=max(maxx[i][k],dp[i][j][k]);}}}//memset(dp,0,sizeof(dp));scanf("%d",&q);for(int i=0;i<q;i++){char c;int jk;getchar();scanf("%d %c",&jk,&c);int num=c-'a';printf("%d\n",min(n,maxx[num][jk]));}return 0;
}

#include <bits/stdc++.h>
using namespace std;typedef long long LL;const long double pi = 3.14159265358979;#define N 100010int x[N], y[N], r[N], dep[N], n;LL dist(int x, int y){ return 1ll * x * x + 1ll * y * y; }int main(){///freopen("in.txt", "r", stdin);scanf("%d", &n);for(int i = 1; i <= n; i ++){scanf("%d %d %d", x + i, y + i, r + i);}for(int i = 1; i <= n; i ++){for(int j = 1; j <= n; j ++)if(r[j] > r[i]) {if( dist( x[i] - x[j], y[i] - y[j]) <= 1ll * r[j] * r[j] ){dep[i] ++;}}}LL ans = 0;for(int i = 1; i <= n; i ++){if(dep[i] == 0) ans += 1ll * r[i] * r[i];else if(dep[i] & 1) ans += 1ll * r[i] * r[i];else ans -= 1ll * r[i] * r[i];}long double res = pi * ans;printf("%.10lf\n", (double) res);}

#include <bits/stdc++.h>
using namespace std;
using LL=long long;
#define f(i,n) for(LL i=0;i<(n);i++)const LL M=1e9+7;LL n,d[50],cn[51][51][51],sl[51][51],n3[51];LL connect(LL twos, LL threes, LL after){if(twos<0||threes<0) return 0;LL &cur=cn[twos][threes][after];if(cur!=-1) return cur;if(after) return cur=(twos*connect(twos-1,threes,after-1)%M//拿出一个two +threes*connect(twos+1,threes-1,after-1)%M)%M;//拿出一个three 向下有一个空位 相当于增加了一个two if(twos) return cur=((twos-1)*connect(twos-2, threes, after)%M//选出一对two互相连接 +threes*connect(twos,threes-1,after)%M)%M;//选出一个three和一个two连接后变成一个two if(!threes) return 1;return cur=((threes-1)*(threes-2)/2)*connect(2,threes-3,0)%M;//选出三个three后相当于增加了2个two }LL solve(LL i, LL f){if(i+f>n) return 0;if(i==n) return f==0;if(f==0) return 0;LL &cur=sl[i][f];if(~cur) return cur;LL r=0, threes=n3[i+f]-n3[i], twos=f-threes;for(LL cl=0;cl<=n-(i+f);cl++)r = (r+connect(twos, threes, cl)*solve(i+f,cl)%M)%M;return cur=r;
}main(){freopen("t.txt","r",stdin);ios::sync_with_stdio(0),cin.tie(0);memset(cn,-1,sizeof(cn));memset(sl,-1,sizeof(sl));    cin>>n;f(i,n){cin>>d[i];n3[i+1]=n3[i]+(d[i]==3);}cout<<solve(1,d[0])<<'\n';
}