The PDF version of this problem can be downloaded here.
3 3 1 2 2 2 2 2 3 3 1 3 2 2 2 2 2 3 2 2 1 1 1 1 2 3 2 3
8 4 3
Migrated from old NTUJ.
ACM ICPC Dalian 2011