// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;


int main() {
	int n, m;
    cin>>n>>m;
    vector<pair<long long, long long>> a(n);
    vector<pair<long long, long long>> c(m);
    int smallest=0;
    for(int i=0;i<n;i++){
        cin>>a[i].first;
        a[i].second=i+1;
    }
    for(int i=0;i<m;i++){
        cin>>c[i].first;
        c[i].second=i+1;
    }
    sort(a.begin(), a.end());
    sort(c.begin(), c.end());
    if(a[0]>c[m-1]){
        cout<<"YES"<<'\n';
    }else{
        cout<<"NO"<<'\n'<<a[0].second<<'\n'<<c[m-1].second<<'\n';
    }
}