The official capital and the cultural capital of Berland are connected by a single road running through n regions. Each region has a unique climate, so the i -th (1 ≤ i ≤ n ) region has a stable temperature of t i degrees in summer. This summer a group of m schoolchildren wants to get from the official capital to the cultural capital to visit museums and sights. The trip organizers transport the children between the cities in buses, but sometimes it is very hot. Specifically, if the bus is driving through the i -th region and has k schoolchildren, then the temperature inside the bus is t i + k degrees. Of course, nobody likes it when the bus is hot. So, when the bus drives through the i -th region, if it has more than T i degrees inside, each of the schoolchild in the bus demands compensation for the uncomfortable conditions. The compensation is as large as x i rubles and it is charged in each region where the temperature in the bus exceeds the limit. To save money, the organizers of the trip may arbitrarily add or remove extra buses in the beginning of the trip, and between regions (of course, they need at least one bus to pass any region). The organizers can also arbitrarily sort the children into buses, however, each of buses in the i -th region will cost the organizers cost i rubles. Please note that sorting children into buses takes no money. Your task is to find the minimum number of rubles, which the organizers will have to spend to transport all schoolchildren. The first input line contains two integers n and m (1 ≤ n ≤ 10 5 ; 1 ≤ m ≤ 10 6 ) — the number of regions on the way and the number of schoolchildren in the group, correspondingly. Next n lines contain four integers each: the i -th line contains t i , T i , x i and cost i ( 1 ≤ t i , T i , x i , cost i ≤ 10 6 ). The numbers in the lines are separated by single spaces. Print the only integer — the minimum number of roubles the organizers will have to spend to transport all schoolchildren. Ple