int main()
{
    vector<int> a;
    a.push_back(0x80000000);
    vector<int> b;
    char c;
    int num;
    while ((c = getchar()) != '\n')
    {
        if (c != ' ')
        {
            ungetc(c, stdin);
            cin >> num;
            a.push_back(num);
        }
    }
    a.push_back(0x7FFFFFFF);
    while ((c = getchar()) != '\n')
    {
        if (c != ' ')
        {
            ungetc(c, stdin);
            cin >> num;
            b.push_back(num);
        }
    }
    int index = 0;
    for (int i = a.size()-1; i>0; i--)
    {
        if (a[i] <= a[i - 1] && a[i] <= a[i + 1])
        {
            index = i;
            break;
        }
    }
    int max = 0x80000000;
    //在b中查找
    for (int i = 0; i < b.size(); i++)
    {
        if (b[i] > a[index-1]&&b[i]<a[index+1]&&b[i]>max)
            max = b[i];
    }
    if (max == 0x80000000)
        cout << "NO" << endl;
    else
    {
        a[index] = max;
        for (int i = 1; i < a.size()-1; i++)
            cout << a[i] << " ";
    }
    return 0;
}