#include <algorithm> #include <cmath> #include <cstring> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <string> #include <unordered_map> #include <vector> using namespace std; using ll = long long; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { string s ; cin >> s; if (s.find("LOVE") != string::npos) { cout << "YES" << endl; return 0; } } cout << "NO" << endl; return 0; }