#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<string, int> mag;
map<string, int> note;
int main() {
int m, n;
string word;
scanf("%d %d", &m, &n);
for (int i = 0; i < m; i++) {
cin >> word;
mag[word] ++;
}
bool isDoable = true;
for (int i = 0; i < n; i++) {
cin >> word;
if (isDoable) {
if (mag.find(word) == mag.end() || mag[word] <= 0) {
isDoable = false;
}
}
mag[word] --;
}
if (isDoable) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
800+ learners
Details →Designing Microservices
A free playlist to help you understand Microservices and their high-level patterns in depth.
17+ learners
Details →GitHub Outage Dissections
A free playlist to help you learn core engineering from outages that happened at GitHub.
67+ learners
Details →Hash Table Internals
A free playlist to help you understand the internal workings and construction of Hash Tables.
25+ learners
Details →BitTorrent Internals
A free playlist to help you understand the algorithms and strategies that power P2P networks and BitTorrent.
42+ learners
Details →