#include<bits/stdc++.h>

using namespace std;

int n,m,a[],b[];

int main()

{

    ios::sync_with_stdio();

    cin >> n >> m;

    for(int i = ;i <= n;i++)   cin >> a[i];

    for(int i = ;i <= m;i++)   cin >> b[i];

    sort(b+,b++m);

    reverse(b+,b++m);

    int now = ;

    for(int i = ;i <= n;i++)

    {

        if(a[i] == )   a[i] = b[++now];

    }

    for(int i = ;i <= n;i++)

    {

        if(a[i-] > a[i])

        {

            cout << "Yes" << endl;

            return ;

        }

    }

    cout << "No" << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,a[],b[],c[],ok[] = {},x[];

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= n;i++)   cin >> a[i];

    for(int i = ;i <= n;i++)   cin >> b[i];

    int cnt = ;

    for(int i = ;i <= n;i++)

    {

        if(a[i] == b[i])    ok[a[i]] = ;

        else    x[++cnt] = i;

    }

    if(cnt == )

    {

        for(int i = ;i <= n;i++)

        {

            if(!ok[i])  a[x[]] = i;

        }

    }

    else

    {

        for(int i = ;i <= n;i++)   c[i] = a[i];

        for(int i = ;i <= n;i++)

        {

            if(!ok[i])

            {

                a[x[]] = i;

                ok[i] = ;

                break;

            }

        }

        for(int i = ;i <= n;i++)

        {

            if(!ok[i])  a[x[]] = i;

        }

        int cnt1 = ,cnt2 = ;

        for(int i = ;i <= n;i++)

        {

            if(a[i] != b[i])    cnt1++;

            if(a[i] != c[i])    cnt2++;

        }

        if(cnt1 !=  || cnt2 != )  swap(a[x[]],a[x[]]);

    }

    for(int i = ;i <= n;i++)   cout << a[i] << " ";

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,q,ans[][] = {},cnt[];

string s;

int main()

{

    ios::sync_with_stdio();

    cin >> n >> s >> q;

    s = ' '+s;

    for(char c = 'a';c <= 'z';c++)

    {

        memset(cnt,,sizeof(cnt));

        for(int i = ;i <= n;i++)

        {

            cnt[i] = cnt[i-];

            if(s[i] != c)   cnt[i]++;

        }

        for(int i = ;i <= n;i++)

        {

            for(int j = i+;j <= n;j++)

            {

                ans[c][cnt[j]-cnt[i]] = max(ans[c][cnt[j]-cnt[i]],j-i);

            }

        }

        for(int i = ;i <= n;i++)   ans[c][i] = max(ans[c][i-],ans[c][i]);

    }

    while(q--)

    {

        int x;

        cin >> x >> s;

        cout << ans[s[]][x] << endl;

    }

    return ;

}

#include<bits/stdc++.h>

#define PI acos(-1)

using namespace std;

int n,x[],y[],r[],cnt[] = {};

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= n;i++)   cin >> x[i] >> y[i] >> r[i];

    for(int i = ;i <= n;i++)

    {

        for(int j = ;j <= n;j++)

        {

            if(i == j)  continue;

            if(sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j])) <= r[j]-r[i])  cnt[i]++;

        }

    }

    double ans = ;

    for(int i = ;i <= n;i++)

    {

        if(cnt[i] ==  || cnt[i]%) ans += PI*r[i]*r[i];

        else    ans -= PI*r[i]*r[i];

    }

    cout << fixed << setprecision() << ans << endl;

    return ;

}