cf175

/*

cf175A 水题 

*/
#include<iostream>
#include<cstdio>
using namespace std;

int main(){
    int n,k;
    while(cin>>n>>k){
        int flag=0;
        for(int i=1;i<=k;i++){
            flag=1;
            if(i==1) cout<<n-i+1;
            else cout<<" "<<n-i+1;
        }    
        for(int i=1;i<=n-k;i++){
            if(!flag) { cout<<i; flag=1; continue; }
            cout<<" "<<i;
        }    
        cout<<endl;
    }
} 

/*

cf175C 贪心 

*/ 
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
//#define abs(x-y) x>y?x-y:y-x
using namespace std;
#define manx 300001
#define int64 __int64
bool s[manx];
int64 p[manx],a[manx];

int main(){
    int n;
    while(cin>>n){
        for(int i=1;i<=n;i++) s[i]=0;
        for(int i=1;i<=n;i++){
            scanf("%I64d",&a[i]);
            if(a[i]>0 && a[i]<=n) s[a[i]]=1;
        }
        sort(a+1,a+n+1);
        int64 sum=0;
        for(int i=1,j=1;i<=n&&j<=n;){
            if(a[i]>0 && a[i]<=n){ 
                if(i>1 && a[i]>a[i-1]){
                    i++; continue; 
                }    
            } 
            if(s[j]) { j++; continue; }
            sum += abs(a[i]-j);
            i++; j++;
        }
        cout<<sum<<endl;
    }
}