import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;


void main() {
    int n, m;
    scan(n);
    auto d = readln.split.to!(int[]);
    scan(m);
    auto t = readln.split.to!(int[]);

    d.sort();
    t.sort();

    while (!d.empty) {
        if (t.front < d.front) {
            writeln("NO");
            return;
        }
        else if (t.front == d.front) {
            t.popFront();
            d.popFront();

            if (t.empty) break;
        }
        else {
            d.popFront();
        }
    }

    writeln(t.empty ? "YES" : "NO");
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}