#include<bits/stdc++.h>
using namespace std;

typedef long long int           ll;
typedef unsigned long long int  ull;
typedef vector<int>             vi;
typedef vector<ll>              vll;
typedef vector<vi>              vvi;
typedef pair<int,int>           pii;
typedef vector< pii >           vpii;
typedef set<int>                sti;

#define pb                      push_back
#define pob                     pop_back
#define mp                      make_pair
#define ff                      first
#define ss                      second
#define loop1(i,n)              for(int i=1; i<int(n); i++)
#define loop(i,y)               for(int i=0; i<int(y); i++)
#define rloop(i,y)              for(int i=int(y); i>0; i--)
#define rloop1(i,y)             for(int i=int(y)-1; i>=0; i--)
#define read()                  freopen("input.txt", "r", stdin)
#define write()                 freopen("output.txt", "w", stdout)
#define cspf(i)                 printf("Case %d: \n", i)
#define all(v)                  v.begin(),v.end()
#define rall(v)                 v.rbegin(),v.rend()
/// Constants
#define eps                     1e-9
#define PI                      acos(-1.0)  // 3.1415926535897932

int main()
{
    ll n,m,x,sm=0,tm;
    cin>>n>>m;
    vll vt;
    loop(i,n){
        cin>>x;
        vt.pb(x);
    }
    sort(rall(vt));
    loop1(i,n){
        if(vt[i]<vt[i-1]){
            sm+=vt[i];
            continue;
        }
        if(vt[i]==vt[i-1] && vt[i]!=1){
            sm+=vt[i];
            vt[i]--;
            continue;
        }
        if(vt[i]>vt[i-1]){
            if(vt[i-1]>1){
                tm=vt[i]-vt[i-1];
                tm++;
                sm+=tm;
                vt[i]=vt[i]-tm;
                sm+=vt[i];
                continue;
            }
            else{
                sm=sm+(vt[i]-1);
                vt[i]=1;
                continue;
            }
        }
    }
    cout<<sm<<endl;
    return 0;
}