The coach of Jacqueline Yo, an Olympic swimmer for Singapore, is worried about her butterfly stroke. He writes down her timing every day in milliseconds, where a millisecond is one thousandth of a second. He promised her a small gift as encouragement on every day she beats the previous day's timing by at least a fixed number of milliseconds.
Given the daily timings, find how many gifts Jacqueline received.
The first line contains two integers n and k. n (3≤n≤100) is the number of days, and k (0<k≤100,000) is the improvement the coach asks for, in milliseconds. Jacqueline receives a gift on every day her timing drops by at least k milliseconds compared with the previous day. Each of the next n lines contains one integer t (0<t≤100,000), her timing for that day in milliseconds. The n records are given in chronological order.
Print a single integer, the number of gifts Jacqueline received.