#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,a) for(int i=(int)0;i<(int)a;++i) #define pb push_back #define eb emplace_back using ll=long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 50; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } using namespace std; void solve(){ int n,m; cin>>n>>m; string s; regex re(".*LOVE*."); bool flag=false; rep(i,n){ cin>>s; if(regex_search(s,re))flag=true; } if(flag)cout<<"YES\n"; else cout<<"NO\n"; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout<