h2. Subtaskuri

* Subtask 1 (8 puncte)

* *Subtask 1 (8 puncte)*

** $K = 2$
** <tex>\sum_{i = 1}^{M} x_i \leq 18 </tex>
** S &le; 20

* Subtask 2 (19 puncte)

* *Subtask 2 (19 puncte)*

** $1 ≤ N,M,S,x{~i~} ≤ 1000$

* Subtask 3 (11 puncte)

* *Subtask 3 (11 puncte)*

** $1 ≤ N,S ≤ 1000$
** $1 ≤ M,x{~i~} ≤ 300000$

* Subtask 4 (12 puncte)

* *Subtask 4 (12 puncte)*

** $x{~i~}$ > lungimea oricărui cuvânt iniţial dintre cele $N$, pentru orice $1 ≤ i ≤ N$

* Subtask 5 (11 puncte)

* *Subtask 5 (11 puncte)*

** $M = 1$

* Subtask 6 (7 puncte)

* *Subtask 6 (7 puncte)*

** $N = 1$

* Subtask 7 (32 de puncte)

* *Subtask 7 (32 de puncte)*

** Fără restricţii suplimentare
h2. Exemplu
table(example). |_. cuvinte6.in |_. cuvinte6.out |

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.
|

| 4 2 2
ab
abaa
bbb
baaa
3
3
| 12 |
| 6 5 3
aab
aabcc
aabb
bbb
bb
aaaab
2
3
6
5
5
| 925829353 |

h3. Explicaţie