What is L(k,m), the largest integer L such that one can find k integers w_1, ..., w_k such that each integer 1, 2, ..., L can be written as a sum m_1 w_1 + ... + m_k w_k with |m_1|+...+|m_k| at most m?
(In the original formulation one wants to be able to pay any amount 1, 2, ..., L using only coins with denominations w_1, ..., w_k, where at most m coins change hands.)
Below we shall assume that the indexing is such that w_1 < w_2 < ... < w_k.