import sys # sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd h,w,k,l,r = map(int,input().split()) if (r-l + 1) % 2 != 0: print("No") exit() s = [input().rstrip() for i in range(h)] dx = [0,0,1,-1] dy = [1,-1,0,0] def bfs(x,y): que = deque([(x,y)]) depth = [[-1 for i in range(w)] for i in range(h)] depth[x][y] = 0 pre = [[-1]*w for i in range(h)] while que: x,y= que.popleft() for i in range(4): nx = x+dx[i] ny = y+dy[i] if not(0<=nx