n,h=map(int,input().rstrip().split())
hud=[]
for i in range(n):
hud.append(int(input()))
l=[]
for i in range(h):
l.append(0)

for i in range(n):
for j in range(hud[i]):
f=l[j]+1
l[j]=f
l.reverse()
f=0
m=min(l)
for i in l:
if i == m:
f+=1

print(m,f)

Firefly code✅✅✅
By Sagar

Valid password✅✅✅

All test case passed😎😎😎

🔔 Pimarq Off Campus Drive 2021 | 0-2 years | SQL Developer | BE/ B.Tech/ ME/ M.Tech/ MCA | Bangalore

* Job Role : SQL Developer/td>
* Qualification : B.E / B.Tech / M.C.A / M.Sc / M.E / M.Tech
* Experience : Freshers (2019 to 2021 Batch)
* Job Location : Bangalore

https://www.pimarq.com/jobs/sql-developer/

🔔 Beepkart Off Campus Drive 2021 | Freshers | Developer | BE/ B.Tech/ ME/ M.Tech | Bangalore | 3.6-5 LPA

* Salary : 3.6 – 5.0 LPA
* Job Role : Front-end Developer/ Back-end Developer
* Qualification : B.E/ B.Tech/ M.E/ M.Tech
* Experience : Freshers
* Job Location : Bangalore
* Last Date : 11 Jun, 2021

https://www.elitmus.com/jobs/32864-beep-innovations-developer-bangalore?jobs_evaluation=2068

📪 @fresherearth

https://www.theforage.com/virtual-internships/prototype/tKxM2fzpMvmuA8sei/SAP-Tech-Consulting-Virtual-Experience-Program#lp

Koi interested hon toh dekh lena

CTS 2021

Should you become a programmer?
www.freecodecamp.org