Divisors of 42 are : 1, 2, 3, 6, 7, 14, 21, 42.
These divisors squared are: 1, 4, 9, 36, 49, 196, 441, 1764.
The sum of the squared divisors is 2500 which is 50 * 50, a square!

Given two integers m, n (1 <= m <= n) we want to find all integers 
between m and n whose sum of squared divisors is itself a square.
42 is such a number.

The result will be an array of arrays or of tuples (in C an array of Pair) or a string, each subarray having two elements,
first the number whose squared divisors is a square and then the sum
of the squared divisors.

#Examples:
```
list_squared(1, 250) --> [[1, 1], [42, 2500], [246, 84100]]
list_squared(42, 250) --> [[42, 2500], [246, 84100]]
```

The form of the examples may change according to the language, see `Example Tests:` for more details.

**Note**

In Fortran - as in any other language - the returned string is not permitted to contain any redundant trailing whitespace: you can use dynamically allocated character strings.

```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 Counter\nfrom functools import reduce\nfrom operator import mul\nfrom random import randrange,randint\n\ndef primesbelow(n):\n    c=n%6>1\n    n={0:n,1:n-1,2:n+4,3:n+3,4:n+2,5:n+1}[n%6]\n    s=[True]*(n//3)\n    s[0]=False\n    for i in range(int(n**0.5)//3+1):\n        if s[i]:\n            k=(3*i+1)|1\n            s[k*k//3::2*k]=[False]*((n//6-(k*k)//6-1)//k+1)\n            s[(k*k+4*k-2*k*(i%2))//3::2*k]=[False]*((n//6-(k*k+4*k-2*k*(i%2))//6-1)//k+1)\n    return [2,3]+[(3*i+1)|1 for i in range(1,n//3-c) if s[i]]\n\nmedsize=100000\nmedprimes=set(primesbelow(medsize))\nsmallprimes=sorted(p for p in medprimes if p<1000)\n\ndef isprime(n,precision=7):\n    if n<1:\n        return False\n    elif n<=3:\n        return n>=2\n    elif n%2==0:\n        return False\n    elif n<medsize:\n        return n in medprimes\n    d=n-1\n    s=0\n    while d%2==0:\n        d//=2\n        s+=1\n    for repeat in range(precision):\n        a=randrange(2,n-2)\n        x=pow(a,d,n)\n        if x==1 or x==n-1: continue\n        for r in range(s-1):\n            x=pow(x,2,n)\n            if x==1: return False\n            if x==n-1: break\n        else: return False\n    return True\n\ndef pollard_brent(n):\n    if n%2==0: return 2\n    if n%3==0: return 3\n    y,c,m=randint(1,n-1),randint(1,n-1),randint(1,n-1)\n    g,r,q=1,1,1\n    while g==1:\n        x=y\n        for i in range(r): y=(pow(y,2,n)+c)%n\n        k=0\n        while k<r and g==1:\n            ys=y\n            for i in range(min(m,r-k)):\n                y=(pow(y,2,n)+c)%n\n                q=q*abs(x-y)%n\n            g=gcd(q,n)\n            k+=m\n        r*=2\n    if g==n:\n        while True:\n            ys=(pow(ys,2,n)+c)%n\n            g=gcd(abs(x-ys),n)\n            if g>1: break\n    return g\n\ndef primefactors(n):\n    fs=[]\n    for c in smallprimes:\n        while n%c==0:\n            fs.append(c)\n            n//=c\n        if c>n: break\n    if n<2: return fs\n    while n>1:\n        if isprime(n):\n            fs.append(n)\n            break\n        f=pollard_brent(n)\n        fs.extend(primefactors(f))\n        n//=f\n    return fs\n\ndef factorization(n):\n    return Counter(primefactors(n))\n\ndef ssd(n):\n    return reduce(mul,((p**(2*e+2)-1)//(p*p-1) for p,e in factorization(n).items()),1)\n\ndef list_squared(m,n):\n    return [a for a in ([x,ssd(x)] for x in range(m,n+1)) if (a[1]**0.5).is_integer()]'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'list_squared'
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: 12010