import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n, t; readV(n, t);
  int[] a; readA(n, a);

  auto m = new int[](n);
  m[$-1] = a[$-1];
  foreach_reverse (i; 0..n-1) m[i] = max(m[i+1], a[i]);

  auto r = 0;
  foreach (i; 0..n-1) r = max(r, m[i+1]-a[i]);

  auto c = 0;
  foreach (i; 0..n-1)
    if (m[i+1]-a[i] == r) ++c;

  writeln(c);
}
