while (found == false) {
			if (stmaze.size() != 0) {
				Point pp = new Point();
				pp = (Point) stmaze.pop();
				X = pp.x;
				Y = pp.y;
				visited[X][Y] = true;

			}
			else {
				flag = true;
				break;
			}
				if (X - 1 >= 0 && maze[X - 1][Y] != '#' && visited[X - 1][Y] == false) {
					if (maze[X - 1][Y] == 'E') {
						found = true;
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X - 1;
						pair[countp][1].y = Y;

					} else {
						//visited[X - 1][Y] = true;
						Point pp1 = new Point();
						pp1.x = X - 1;
						pp1.y = Y;
						stmaze.push(pp1);

					}

					if (countp < pair.length && found == false) {
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X - 1;
						pair[countp][1].y = Y;
						countp++;
					}

				}
				if (Y - 1 >= 0 && maze[X][Y - 1] != '#' && visited[X][Y - 1] == false) {
					if (maze[X][Y - 1] == 'E') {
						found = true;
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X;
						pair[countp][1].y = Y - 1;

					} else {

						//visited[X][Y - 1] = true;
						Point pp4 = new Point();
						pp4.x = X;
						pp4.y = Y - 1;
						stmaze.push(pp4);

					}
				if (countp < pair.length && found == false) {
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X;
						pair[countp][1].y = Y - 1;
						countp++;
					}
				}

				if (X + 1 < N && maze[X + 1][Y] != '#' && visited[X + 1][Y] == false) {
					if (maze[X + 1][Y] == 'E') {
						found = true;

						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X + 1;
						pair[countp][1].y = Y;

					} else {
						//visited[X + 1][Y] = true;
						Point pp3 = new Point();
						pp3.x = X + 1;
						pp3.y = Y;
						stmaze.push(pp3);
					}
					if (countp < pair.length && found == false) {
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X + 1;
						pair[countp][1].y = Y;
						countp++;
					}

				}
				if (Y + 1 < M && maze[X][Y + 1] != '#' && visited[X][Y + 1] == false) {
					if (maze[X][Y + 1] == 'E') {
						found = true;

						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X;
						pair[countp][1].y = Y + 1;

					} else {
						//visited[X][Y + 1] = true;
						Point pp2 = new Point();
						pp2.x = X;
						pp2.y = Y + 1;
						stmaze.push(pp2);

					}
					if (countp < pair.length && found == false) {
						pair[countp][0].x = X;
						pair[countp][0].y = Y;
						pair[countp][1].x = X;
						pair[countp][1].y = Y + 1;
						countp++;
					}

				}

		}