#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = __LONG_LONG_MAX__;

constexpr int INF = 1e9+7;

const double PI=3.14159265358979323846;


vector<int> dx = {-1,0,1,0,-1,1,-1,1};
vector<int> dy = {0,-1,0,1,1,-1,-1,1};

/* template */

template<class T>
struct SlidingWindowAggregation{
    private:
      struct node{
          T val,sum;
          node(T val,T sum) : val(val),sum(sum) {}
      };

      using F=std::function<T(T,T)>;
      std::stack<node> front_stack,back_stack;
      F fn;

      void slide(){
          assert(front_stack.empty());
          node x = back_stack.top();
          back_stack.pop();
          x.sum = x.val;
          front_stack.push(x);
          while(!back_stack.empty()){
              node a = back_stack.top();
              back_stack.pop();
              a.sum = fn(a.val,front_stack.top().sum);
              front_stack.push(a);
          }
      }

    public:
      SlidingWindowAggregation(F fn) : fn(fn), front_stack(), back_stack() {}

      int size(){
          return (front_stack.size()+back_stack.size());
      }

      bool empty(){
          return !size();
      }

      void push(T x){
          node a(x,x);
          if(!back_stack.empty()){
              a.sum = fn(back_stack.top().sum,a.val);
          }
          back_stack.push(a);
      }

      void pop(){
          assert(!empty());
          if(front_stack.empty()){
              slide();
          }
          front_stack.pop();
      }

      T fold_all(){
          assert(!empty());
          if(back_stack.empty()){
              return front_stack.top().sum; 
          }
          else if(front_stack.empty()){
              return back_stack.top().sum;
          }
          else{
              return fn(front_stack.top().sum,back_stack.top().sum);
          }
      }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,t; cin >> n >> t;
    vector<ll> a(n);
    SlidingWindowAggregation<ll> s([](ll x,ll y){ return max(x,y); });
    rep(i,0,n){
        cin >> a[i];
        s.push(a[i]);
    }
    ll ans = 0;
    ll c = 0;
    rep(i,0,n-1){
        s.pop();
        if(c<(s.fold_all()-a[i])){
            c = s.fold_all()-a[i];
            ans = 1;
        }
        else if(c==(s.fold_all()-a[i])){
            ans++;
        }
        debug(s.fold_all()-a[i]);
    }
    cout << ans << endl;
}

Measured memory_bytes: 2816