PivotOJ

BIJELE

시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2007-2008BOJ 3003

문제

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. 

입력

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 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. 

예제

예제 1

입력
0 1 2 2 2 7
출력
1 0 0 0 0 1

예제 2

입력
2 1 2 1 2 1
출력
-1 0 0 1 0 7
코드를 제출하려면 로그인하세요.