When n processes communicate by writing to and reading from k < n MWMR registers the "communication bandwidth" precludes emulation of SWMR system, even non-blocking. Nevertheless, recently a positive result was shown that such a system either wait-free or obstruction-free can solve an interesting one-shot task. This paper demonstrates another such result. It shows that (n − 1)-set agreement can be solved obstruction-free with merely 2 MWMR registers. Achieving k-set agreement with n − k + 1 registers is a challenge. We make the first step toward it by showing k-set agreement with 2(n − k) registers.