Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Change-free

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputStudent Arseny likes to plan his life for *n* days ahead. He visits a canteen every day and he has already decided what he will order in each of the following *n* days. Prices in the canteen do not change and that means Arseny will spend *c*_{i} rubles during the *i*-th day.

There are 1-ruble coins and 100-ruble notes in circulation. At this moment, Arseny has *m* coins and a sufficiently large amount of notes (you can assume that he has an infinite amount of them). Arseny loves modern technologies, so he uses his credit card everywhere except the canteen, but he has to pay in cash in the canteen because it does not accept cards.

Cashier always asks the student to pay change-free. However, it's not always possible, but Arseny tries to minimize the dissatisfaction of the cashier. Cashier's dissatisfaction for each of the days is determined by the total amount of notes and coins in the change. To be precise, if the cashier gives Arseny *x* notes and coins on the *i*-th day, his dissatisfaction for this day equals *x*·*w*_{i}. Cashier always gives change using as little coins and notes as possible, he always has enough of them to be able to do this.

Arseny wants to pay in such a way that the total dissatisfaction of the cashier for *n* days would be as small as possible. Help him to find out how he needs to pay in each of the *n* days!

Note that Arseny always has enough money to pay, because he has an infinite amount of notes. Arseny can use notes and coins he received in change during any of the following days.

Input

The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 10^{5}, 0 ≤ *m* ≤ 10^{9}) — the amount of days Arseny planned his actions for and the amount of coins he currently has.

The second line contains a sequence of integers *c*_{1}, *c*_{2}, ..., *c*_{n} (1 ≤ *c*_{i} ≤ 10^{5}) — the amounts of money in rubles which Arseny is going to spend for each of the following days.

The third line contains a sequence of integers *w*_{1}, *w*_{2}, ..., *w*_{n} (1 ≤ *w*_{i} ≤ 10^{5}) — the cashier's dissatisfaction coefficients for each of the following days.

Output

In the first line print one integer — minimum possible total dissatisfaction of the cashier.

Then print *n* lines, the *i*-th of then should contain two numbers — the amount of notes and the amount of coins which Arseny should use to pay in the canteen on the *i*-th day.

Of course, the total amount of money Arseny gives to the casher in any of the days should be no less than the amount of money he has planned to spend. It also shouldn't exceed 10^{6} rubles: Arseny never carries large sums of money with him.

If there are multiple answers, print any of them.

Examples

Input

5 42

117 71 150 243 200

1 1 1 1 1

Output

79

1 17

1 0

2 0

2 43

2 0

Input

3 0

100 50 50

1 3 2

Output

150

1 0

1 0

0 50

Input

5 42

117 71 150 243 200

5 4 3 2 1

Output

230

1 17

1 0

1 50

3 0

2 0

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/23/2017 11:02:28 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|