Given a rectangle of size n x m, find the minimum number of integer-sided squares that tile the rectangle.
 
Example 1:

Input: n = 2, m = 3
Output: 3
Explanation: 3 squares are necessary to cover the rectangle.
2 (squares of 1x1)
1 (square of 2x2)
Example 2:

Input: n = 5, m = 8
Output: 5

Example 3:

Input: n = 11, m = 13
Output: 6

 
Constraints:

1 <= n <= 13
1 <= m <= 13

```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 = "class Solution:\n    def tilingRectangle(self, n: int, m: int) -> int:\n        #\n        # Store a dictionary of squares of numbers from 1 to 13\n        # keyed by the square values\n        #\n        from functools import lru_cache\n        @lru_cache(None)\n        def dp(n, m):\n            '''\n            Returns the min num of square blocks for nxm rectangle\n            '''\n            p, q = min(n,m), max(n,m)\n            \n            if p == 0:\n                return 0\n            \n            if p == 1:\n                return q\n            \n            if q % p == 0:\n                return q // p\n            \n            minunits = p*q\n            \n            #split on one axis at a time            \n            for r in range(1,p):\n                minunits = min(minunits, 1 + dp(p-r, r) + dp(p, q-r))\n                minunits = min(minunits, 1 + dp(q-r, r) + dp(q, p-r))\n\n            #split on both axes at the same time\n            #       cl---->\n            #     _________________________   rr\n            #     |        |               |  |\n            #     |        |               |  |\n            #     |        |               |  v\n            #     |        |---------------|  \n            #     |        |      |        |\n            #     |        |      |        |\n            #     |----------------        |\n            # ^   |               |        |\n            # |   |               |        |\n            # rl  |               |        |\n            #     -------------------------\n            #                      <----- cr\n            #     <--------- n ------------>\n            #\n            \n            for cl in range(1, n):\n                for cr in range(1, n - cl):\n                    for rl in range(1, m):\n                        for rr in range(1, m - rl):\n                            minunits = min(minunits,\n                                dp(rl, n-cr) +\n                                dp(m-rl, cl) +\n                                dp(n-cl, rr) +\n                                dp(m-rr, cr) +\n                                dp(n-cl-cr, m-rl-rr)\n                            )\n            return minunits\n    \n        return dp(n,m)\n        \n        \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'tilingRectangle'
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: 8718