user
There is a highly organized city that has decided to assign a number to each of their departments:

:   :   * police department
        * sanitation department
        * fire department

Each department can have a number between   **1**   and   **7**   (inclusive).

The three department numbers are to be unique (different from each other) and must add up to   **12**.

The Chief of the Police doesn't like odd numbers and wants to have an even number for his department.

Task

Write a computer program which outputs all valid combinations.

Possible output   (for the 1st and 14th solutions):

```
 --police--  --sanitation--  --fire-- 
     2             3            7 
     6             5            1

```
assistant
(formerly Perl 6)

```
for (1..7).combinations(3).grep(*.sum == 12) {
    for   .permutations\  .grep(*.[0] %%  2) {
        say <police fire sanitation> Z=> .list;
    }
}

```

Output:

```
(police => 4 fire => 1 sanitation => 7)
(police => 4 fire => 7 sanitation => 1)
(police => 6 fire => 1 sanitation => 5)
(police => 6 fire => 5 sanitation => 1)
(police => 2 fire => 3 sanitation => 7)
(police => 2 fire => 7 sanitation => 3)
(police => 2 fire => 4 sanitation => 6)
(police => 2 fire => 6 sanitation => 4)
(police => 4 fire => 2 sanitation => 6)
(police => 4 fire => 6 sanitation => 2)
(police => 6 fire => 2 sanitation => 4)
(police => 6 fire => 4 sanitation => 2)
(police => 4 fire => 3 sanitation => 5)
(police => 4 fire => 5 sanitation => 3)

```