In a 1 million by 1 million grid, the coordinates of each grid square are (x, y) with 0 <= x, y < 10^6.
We start at the source square and want to reach the target square.  Each move, we can walk to a 4-directionally adjacent square in the grid that isn't in the given list of blocked squares.
Return true if and only if it is possible to reach the target square through a sequence of moves.
 
Example 1:
Input: blocked = [[0,1],[1,0]], source = [0,0], target = [0,2]
Output: false
Explanation: 
The target square is inaccessible starting from the source square, because we can't walk outside the grid.

Example 2:
Input: blocked = [], source = [0,0], target = [999999,999999]
Output: true
Explanation: 
Because there are no blocked cells, it's possible to reach the target square.

 
Note:

0 <= blocked.length <= 200
blocked[i].length == 2
0 <= blocked[i][j] < 10^6
source.length == target.length == 2
0 <= source[i][j], target[i][j] < 10^6
source != target

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from collections import deque\nclass Solution:\n    def isEscapePossible(self, blocked: List[List[int]], source: List[int], target: List[int]) -> bool:\n        if not blocked or not blocked[0]:\n            return True\n        \n        blocked = set(map(tuple, blocked))\n        print(blocked)\n        return self.bfs(tuple(source), tuple(target), blocked) and self.bfs(tuple(target), tuple(source), blocked)\n        \n        \n        \n    def bfs(self, source, target, blocked):\n        directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n        \n        queue = deque([source])\n        \n        visited = set([source])\n        \n        while queue:\n            x, y = queue.popleft()\n            for (dx, dy) in directions:\n                x_ , y_ = x + dx, y + dy\n                if 0 <= x_ < 10 ** 6 and 0 <= y_ < 10 ** 6 and (x_, y_) not in visited and (x_, y_) not in blocked:\n                    if x_ == target[0] and y_ == target[1]:\n                        return True\n                    queue.append((x_, y_))\n                    visited.add((x_, y_))\n            if len(visited) > 20000:\n                return True\n        return False\n    \n                    \n                 \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n#     def isEscapePossible(self, blocked, source, target):\n#         blocked = set(map(tuple, blocked))\n\n#         def dfs(x, y, target, seen):\n#             if not (0 <= x < 10**6 and 0 <= y < 10**6) or (x, y) in blocked or (x, y) in seen: return False\n#             seen.add((x, y))\n#             if len(seen) > 20000 or [x, y] == target: return True\n#             return dfs(x + 1, y, target, seen) or \\\\\n#                 dfs(x - 1, y, target, seen) or \\\\\n#                 dfs(x, y + 1, target, seen) or \\\\\n#                 dfs(x, y - 1, target, seen)\n#         return dfs(source[0], source[1], target, set()) and dfs(target[0], target[1], source, set())\n# Python, BFS:\n#     def isEscapePossible(self, blocked, source, target):\n#         blocked = {tuple(p) for p in blocked}\n\n#         def bfs(source, target):\n#             bfs, seen = [source], {tuple(source)}\n#             for x0, y0 in bfs:\n#                 for i, j in [[0, 1], [1, 0], [-1, 0], [0, -1]]:\n#                     x, y = x0 + i, y0 + j\n#                     if 0 <= x < 10**6 and 0 <= y < 10**6 and (x, y) not in seen and (x, y) not in blocked:\n#                         if [x, y] == target: return True\n#                         bfs.append([x, y])\n#                         seen.add((x, y))\n#                 if len(bfs) == 20000: return True\n#             return False\n#         return bfs(source, target) and bfs(target, source)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'isEscapePossible'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7877