public static void dfs(int x, int y) {
		if (L[x][y] == 'w')
			L[x][y] = '.';

		for (int lx = -1; lx <= 1; lx++)
			for (int ry = -1; ry <= 1; ry++) {
				if (lx + x >= 0 && lx + x < L.length && ry + y >= 0
						&& ry + y < L[0].length ) {
					if( L[lx + x][ry + y] == 'w')
						dfs(lx + x, ry + y);
				}
			}

	}