### COCI 2007/2008, Contest #2

## Task BIJELE

Mirko has found an old chessboard and a set of pieces in his attic. Unfortunately, the set contains only white pieces, and apparently an incorrect number of them. A set of pieces should contain:

- One king
- One queen
- Two rooks
- Two bishops
- Two knights
- Eight pawns

Mirko would like to know how many pieces of each type he should **add or remove** to make a valid set.

### Input

The input consists of 6 integers on a single line, each between 0 and 10 (inclusive). The numbers are, in order, the numbers of kings, queens, rooks, bishops, knights and pawns in the set Mirko found.

### Output

Output should consist of 6 integers on a single line; the number of pieces of each type Mirko should add or remove. If a number is positive, Mirko needs to add that many pieces. If a number is negative, Mirko needs to remove pieces.

### Examples

## Input0 1 2 2 2 7 ## Output1 0 0 0 0 1 |
## Input2 1 2 1 2 1 ## Output-1 0 0 1 0 7 |

All Submissions

Best Solutions

**Point Value:** 3

**Time Limit:** 1.00s

**Memory Limit:** 32M

**Added:** Jul 30, 2013

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

hezeyu2007on Oct 17, 2017 - 12:20:00 pm UTC what's bijele