https://cn.vjudge.net/problem/Gym-101933H
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=998244353;
struct node
{
ll p,c,t,r;
string s;
}a[maxn];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n,m;
cin>>n>>m;
getchar();
for(int i=1;i<=m;i++)
{
string s;
getline(cin,s);
int len=s.length();
ll d=0,num=0,cnt=1;
//cout<<s<<endl;
for(int j=len-1;j>=0;j--)
{
//cout<<s[j];
if(s[j]==',')
{
d++;
if(d==1)
{
a[i].r=num;
}
else if(d==2)
{
a[i].t=num;
}
else if(d==3)
{
a[i].c=num;
}
else if(d==4)
{
a[i].p=num;
a[i].s=s.substr(0,j);
break;
}
num=0;
cnt=1;
}
else
{
num+=cnt*(s[j]-'0');
cnt*=10;
}
}
}
ll minn=INF;
vector<string>ans;
for(int i=1;i<=m;i++)
{
//cout<<a[i].s<<" "<<a[i].p<<" "<<a[i].c<<" "<<a[i].t<<" "<<a[i].r<<endl;
double t=a[i].t;
double r=a[i].r;
double c=a[i].c;
double num=10080/(t+r);
if(c*t*num>=(double)n)
{
if(minn>a[i].p)
{
minn=a[i].p;
ans.clear();
ans.pb(a[i].s);
}
else if(minn==a[i].p) ans.pb(a[i].s);
}
}
if(minn==INF)
{
cout<<"no such mower"<<endl;
}
else
{
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<endl;
}
}
return 0;
}