* $1 ≤ N, M ≤ 50.000$
* $0 ≤ b{~i~} ≤ 10^9^$

* Prin a mod b se intelege restul impartirii lui a la b
* Se garanteaza existenta a cel putin unei solutii
* Sirul $a{~0~}, a{~1~},... a{~N-1~}$ trebuie sa contina numere naturale (nu neaparat nenule)

h2. Exemplu
table(example). |_. criptare.in |_. criptare.out |

| 3 2
3 5 4
| 1 2 3 |
| 6 4
8 13 11 13 17 10
| 2 5 0 1 7 3
|

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

== include(page="template/taskfooter" task_id="criptare") ==

...
== include(page="template/taskfooter" task_id="criptare") ==

1442