Given a certain number, how many multiples of three could you obtain with its digits?

Suposse that you have the number 362. The numbers that can be generated from it are:
```
362 ----> 3, 6, 2, 36, 63, 62, 26, 32, 23, 236, 263, 326, 362, 623, 632 
```
But only:

```3, 6, 36, 63``` are multiple of three.

We need a function that can receive a number ann may output in the following order:

- the amount of multiples

- the maximum multiple

Let's see a case the number has a the digit 0 and repeated digits:
```
6063 ----> 0, 3, 6, 30, 36, 60, 63, 66, 306, 360, 366, 603, 606, 630, 636, 660, 663, 3066, 3606, 3660, 6036, 6063, 6306, 6360, 6603, 6630
```
In this case the multiples of three will be all except 0

```
6063 ----> 3, 6, 30, 36, 60, 63, 66, 306, 360, 366, 603, 606, 630, 636, 660, 663, 3066, 3606, 3660, 6036, 6063, 6306, 6360, 6603, 6630
```

The cases above for the function:
```python
find_mult_3(362) == [4, 63]

find_mult_3(6063) == [25, 6630]
```
In Javascript ```findMult_3()```.
The function will receive only positive integers (num > 0), and you don't have to worry for validating the entries.

Features of the random tests:
```
Number of test = 100
1000 ≤ num ≤ 100000000
```
Enjoy it!!

```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 functools import reduce\n\n# get a len = 10 array with occurrences of digits\ndef num_to_arr(num):\n    s = str(num)\n    arr = [0] * 10\n    for c in s:\n        arr[int(c)] += 1\n    return arr\n\n# get an array of distinctive digits in an array as above\ndef dist_digits(arr):\n    dist = []\n    for i in range(0,10):\n        if arr[i] > 0:\n            dist.append(i)\n    return dist\n\n# get all combos given number of digits (m) and an array as above\ndef all_combos(arr, m):\n    combos = []\n    if m == 1:\n        for i in range(1,10):\n            if arr[i] > 0:\n                combos.append([i])\n        return combos\n\n    if m > sum(arr):\n        return []\n\n    digits = dist_digits(arr)\n    for d in digits:\n        nextArr = [0] * 10\n        for i in range(0,10):\n            if i == d:\n                nextArr[i] = arr[i] - 1\n            if i > d:\n                nextArr[i] = arr[i]\n        nextCombos = all_combos(nextArr, m - 1)\n        for nextComb in nextCombos:\n            nextComb.append(d)\n        combos.extend(nextCombos)\n    return combos\n\n# now give all combos with all possible numbers of digits that % 3 == 0\ndef complete_combos(arr):\n    combos = []\n    for i in range(1, len(arr)):\n        combos.extend(all_combos(arr,i))\n    return list([arr for arr in combos if sum(arr) % 3 == 0])\n\ndef fact(n, zeros = 0):\n    if n == 0: return 1\n    if n == 1: return 1\n    return (n - zeros) * fact(n - 1)\n\ndef permus(combo):\n    arr = [0] * 10\n    for digit in combo:\n        arr[digit] += 1\n    duplicates = 1\n    for i in range(0,10):\n        if arr[i] > 1:\n            duplicates *= fact(arr[i])\n    return fact(len(combo), zeros = arr[0]) // duplicates\n\ndef find_mult_3(num):\n    # your code here\n    comp_combos = complete_combos(num_to_arr(num))\n    return [sum(map(permus,comp_combos)), reduce(lambda x,y: x * 10 + y, comp_combos[-1])]\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'find_mult_3'
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: 8682