Multiply Every Element by k

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array $A=(a_0,a_1,\ldots,a_{n-1})$ and an integer $k$, multiply every array element by $k$.

For each index $0\le i<n$,

Print the transformed array in its original index order.

Input

• The first line contains $n$.
• The second line contains $n$ integers $a_i$.
• The third line contains the integer $k$.

Output

Print one line with the $n$ values $b_i=a_i\cdot k$, separated by single spaces.

Subtasks

Subtask 1 (100 points): $1\le n\le10^5$, $|a_i|\le10^9$, $|k|\le10^9$. Every result fits in signed 64-bit long long.

Examples

Input

5
2 -3 0 4 10
-2

Output

-4 6 0 -8 -20

Explanation

With $k=-2$, the products are $2\cdot(-2)=-4$, $-3\cdot(-2)=6$, $0$, $4\cdot(-2)=-8$, and $10\cdot(-2)=-20$.