#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn = 1e6 + ;

int dp[maxn];

void work() {

    int n, t;

    scanf("%d%d", &n, &t);

    if (n == ) while();

    int mi = (1LL << ) - ;

    int mx = -((1LL << ) - );

    for (int i = ; i <= n; ++i) {

        int x;

        scanf("%d", &x);

        dp[i] = max(, x - mi);

        mi = min(mi, x);

        mx = max(mx, dp[i]);

    }

    int tim = ;

    for (int i = ; i <= n; ++i) {

        tim += dp[i] == mx;

    }

    int ans = tim;

    cout << ans << endl;

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    work();

    return ;

}