Write
```python
smaller(arr)
```
that given an array ```arr```, you have to return the amount of numbers that are smaller than ```arr[i]``` to the right.

For example:
```python
smaller([5, 4, 3, 2, 1]) == [4, 3, 2, 1, 0]
smaller([1, 2, 0]) == [1, 1, 0]
```
``` haskell
smaller [5,4,3,2,1]  `shouldBe` [4,3,2,1,0]
smaller [1,2,3]      `shouldBe` [0,0,0]
smaller [1, 2, 0]    `shouldBe` [1, 1, 0]
```
If you've completed this one and you feel like testing your performance tuning of this same kata, head over to the much tougher version How many are smaller than me II?

```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 = '# modified merge sort counting left > right cases\ndef countsort(arr, cntarr, cntdict):\n    if len(arr) > 1:\n        mid = len(arr) // 2\n        left = arr[:mid]\n        leftcount = cntarr[:mid]\n        right = arr[mid:]\n        rightcount = cntarr[mid:]\n         \n        countsort(left, leftcount, cntdict)\n        countsort(right, rightcount, cntdict)\n        \n        i = 0\n        j = 0\n        k = 0\n        while( i < len(left) and j < len(right) ):\n            if left[i] > right[j]:\n                arr[k] = right[j]\n                \n                # increase count of smaller elem\n                for n in range(i, len(left)):\n                    temp = leftcount[n]\n                    cntdict[temp] = cntdict[temp] + 1\n                \n                # updates position of indices wrt original position \n                cntarr[k] = rightcount[j]\n                j = j + 1\n            else:\n                arr[k] = left[i]\n                cntarr[k] = leftcount[i]\n                i = i + 1\n\n            k = k + 1\n\n        while i < len(left):\n            arr[k] = left[i]\n            cntarr[k] = leftcount[i]\n            i = i + 1\n            k = k + 1\n\n        while j < len(right):\n            arr[k] = right[j]\n            cntarr[k] = rightcount[j]\n            j = j + 1\n            k = k + 1\n            \ndef smaller(arr):\n    # list of relative position of original list\n    posarr = [i for i in range(len(arr))]\n\n    # dictionary of counts of smaller elem\n    cntdict = {i:0 for i in range(len(arr))}\n\n    # sorts arr and keeps count of smaller elem actions \n    countsort(arr, posarr, cntdict)   \n\n    soln = []\n    for i in range(len(arr)):\n        soln.append(cntdict[i])\n\n    return soln\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'smaller'
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: 8276