playing with P n C

You are given an integer N. You have to arrange all integers in range($0 \leq i \lt N$) in M arrays such that each array consists of only distinct elements in it and all M arrays have the equal size. But there is one twist. You are also given an integer K and you have to ensure that union of any k or more arrays should result in the complete set of elements ($0 \leq i \lt N$) but union of any numb