//I did it!!
#include<iostream>
#include<algorithm>
#include<fstream>
#define maxSize 1020
using namespace std;
struct node
{
double sum;
string s;
};
int m,n;
node array[maxSize];
bool cmp(const node &a,const node &b)
{
if(a.sum!=a.sum) return a.sum<b.sum;
else return a.sum<b.sum;
}
void input(int &m,int &n)
{
ifstream cin("c.in");
cin>>m>>n;
for(int i=0;i<m;i++)
{
int j;
cin>>array[i].s;
cin>>j;
if(j==1)
{
double k,yan;
cin>>k>>yan;
array[i].sum=(double)k/yan;
}
else
{
double k1,k2,yan;
cin>>k1>>k2>>yan;
array[i].sum=(yan*j)/(k1+k2*(j-1));
cout<<array[i].sum<<" ";
}
}
}
void nodeSort(int &m,int &n)
{
sort(array,array+m,cmp);
for(int i=0;i<n;i++)
{
cout<<array[i].s<<endl;
}
}
int main()
{
input(m,n);
nodeSort(m,n);
return 0;
}
c.in:
6 3
radish 1 10 15
rose 1 18 23
watermelon 2 28 13 23
grapefruit 3 61 26 39
pitaya 4 70 29 41
blueberry 5 31 14 18