package oanquan;
import java.util.Scanner;
import java.util.Arrays;
public class OAnQuan
{

    public static void main(String[] args)
    {
        Scanner mk= new Scanner(System.in);
        int n= mk.nextInt();
        int k= mk.nextInt();
        if (n<1|| n>1000||k<1|| k>n)
        {
            System.out.print("\nErorr!!");return;
        }
        int []A= new int[n];
        for(int i=1;i<=n;i++)
        {
            A[i]= mk.nextInt();
            if(A[i]<1)
            {
                System.out.print("\nErorr!! nhap lai"); break;
            }
        }
        for(int i=1;i<=n;i++)
        {
            int h=A[k];
            A[k]=0;
            while (h>0)
            {
                A[i]=A[i]+1;

                if(i== n)
                {
                    for(int j=1;j<=n;i++)
                    {
                        A[j]=A[j]+1;

                    }
                }
                h=h-1;
            }
        }
        for(int i=1;i<=n;i++)
        {
            System.out.format("%d", A[i]);
        }
    }

}