#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void init();
void solve();

#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i >= (int) (b); i--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x

#ifdef LOCAL
#define lcout(a) cout << a;
#define lcoutln(a) cout << a << endl;
#define lcerr(a) cerr << a;
#define lcerrln(a) cerr << a << endl;
#else
#define lcout(a) 
#define lcoutln(a) 
#define lcerr(a) 
#define lcerrln(a) 
#endif
#define MOD 1000000007

vector<string> v(50);
int h, w;

signed main()
{
	init();
	solve();
}

void init()
{
	cin >> h >> w;
	rep(i, h) cin >> v[i];
}

bool ch(int r, int c)
{
	if (c + 3 > w - 1) return false;
	string s = "LOVE";
	reps(i, c, c+4) {
		if (v[r][i] != s[i-c]) return false;
	}
	return true;
}


void solve()
{
	rep(i, h) {
		rep(j, w) {
			if (ch(i, j)) {
				PRINT(true);
				return;
			}
		}
	}
	PRINT(false);
}