A generalization of Bézier surfaces, called the S-patch, uses an interesting scheme for indexing its control points.

In the case of an n-sided surface of degree d, each index has n non-negative integers that sum to d, and all possible configurations are used.

For example, for a 3-sided quadratic (degree 2) surface the control points are:

> indices 3 2 => [[0,0,2],[0,1,1],[0,2,0],[1,0,1],[1,1,0],[2,0,0]]

Given the degree and the number of sides, generate all control point indices.
The order of the indices in the list can be arbitrary, so for the above example

> [[1,1,0],[2,0,0],[0,0,2],[0,2,0],[0,1,1],[1,0,1]]

is also a good solution.

```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 = 'import itertools \n\ndic={1:[[1]],2:[[2],[1,1]],3:[[3],[2,1],[1,1,1]],\n    4:[[4],[3,1],[2,1,1],[2,2],[1,1,1,1]],\n    5:[[5],[4,1],[3,1,1],[3,2],[2,1,1,1],[2,2,1],[1,1,1,1,1]],\n    6:[[6],[5,1],[4,1,1],[4,2],[3,1,1,1],[3,2,1],[3,3],[2,1,1,1,1],[2,2,1,1],[2,2,2],[1,1,1,1,1,1]],\n    7:[[7],[6,1],[5,1,1],[5,2],[4,1,1,1],[4,2,1],[4,3],[3,1,1,1,1],[3,2,1,1],[3,2,2],[3,3,1],[2,1,1,1,1,1],[2,2,1,1,1],[2,2,2,1],[1,1,1,1,1,1,1]],\n    8:[[8],[7,1],[6,1,1],[6,2],[5,1,1,1],[5,2,1],[5,3],[4,1,1,1,1],[4,2,1,1],[4,2,2],[4,3,1],[4,4],[3,1,1,1,1,1],[3,2,1,1,1],[3,2,2,1],[3,3,1,1],[2, 3, 3],[2,1,1,1,1,1,1],[2,2,1,1,1,1],[2,2,2,1,1],[2,2,2,2],[1,1,1,1,1,1,1,1]],\n    9:[[9],[8,1],[7,1,1],[7,2],[6,1,1,1],[6,2,1],[6,3],[5,1,1,1,1],[5,2,1,1],[5,2,2],[5,3,1],[5,4],[4,3,1, 1],[4,1,1,1,1,1],[4,2,1,1,1],[4,2,2,1],[4,2,3],[3,3,3],[3,3,1,1,1],[3,3,2,1],[3,1,1,1,1,1,1],[3,2,1,1,1,1],[3,2,2,1,1],[3,2,2,2],[4,4,1],[2,1,1,1,1,1,1,1],[2,2,1,1,1,1,1],[2,2,2,1,1,1],[2,2,2,2,1],[1,1,1,1,1,1,1,1,1]],\n        \n    }\n\n\ndef indices(n, d):\n    print (n,d)\n    l=[]\n    original=[0]*n\n    if not d:\n        return [original]\n\n    for i in dic[d]:\n        if len(i)>n:\n            continue\n        t=i+[0]*(n-len(i))\n        l.extend(list(set(list(itertools.permutations(t)  )  )))\n    print("c->",sorted(l)  )\n    \n    \n    \n\n    return map(list,l)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'indices'
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: 6142