#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll inf = ll(1e18) + 2;
const ll mod = 998244353;

struct node {
    ll x;
    ll p;

    node(ll x_ = -inf, ll p_ = 0) {
        x = x_;
        p = p_;
    }
};

node c(node a, node b) {
    node j;
    j.x = a.x + b.x;
    j.p = 0;
    return j;
}

struct st {
    ll n;
    node t[4 * 200001 + 11];

    void build(ll v, vector<ll> &a, ll tl, ll tr) {
        if (tl == tr) {
            t[v].x = a[tl];
            t[v].p = 0;
        } else {
            ll tm = (tl + tr) / 2;
            build(2 * v, a, tl, tm);
            build(2 * v + 1, a, tm + 1, tr);
            t[v] = c(t[2 * v], t[2 * v + 1]);
        }
    }

    void push(ll v) {
        if (t[v].p != 0) {
            t[2 * v].x += t[v].p;
            t[2 * v].p += t[v].p;
            t[2 * v + 1].x += t[v].p;
            t[2 * v + 1].p += t[v].p;
            t[v].p = 0;
        }
    }

    node get(ll v, ll tl, ll tr, ll l, ll r) {
        if (l > tr || r < tl || l > r) {
            return {};
        }
        if (tl != tr) {
            push(v);
        }
        if (tl == l && tr == r) {
            return t[v];
        }
        ll tm = (tl + tr) / 2;
        return c(get(2 * v, tl, tm, l, min(tm, r)), get(2 * v + 1, tm + 1, tr, max(l, tm + 1), r));
    }

    void upd(ll v, ll tl, ll tr, ll l, ll r, ll x) {
        if (l > tr || r < tl || l > r) {
            return;
        }
        if (tl != tr) {
            push(v);
        }
        if (tl == l && tr == r) {
            t[v].x += x;
            t[v].p += x;
            return;
        }
        ll tm = (tl + tr) / 2;
        upd(2 * v, tl, tm, l, min(tm, r), x);
        upd(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, x);
        t[v] = c(t[2 * v], t[2 * v + 1]);
    }
};

ll bp(ll a, ll n) {
    if (n == 0) {
        return 1 % mod;
    }
    ll k = bp(a, n / 2);
    if (n % 2 == 0) {
        return (k * k) % mod;
    }
    return (((k * k) % mod) * a) % mod;
}

inline void solve() {
    ll f_g, n, m;
    cin >> f_g >> n >> m;
    string s;
    cin >> s;
    vector<ll> a(n);
    set<ll> s2;
    for (ll i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
        s2.insert(a[i]);
    }
    if (n >= m) {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}
