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=0;i<n;i++)
        {
            A[i]= mk.nextInt();
            if(A[i]<1)
            {
                System.out.print("\nErorr!! nhap lai"); break;
            }
        }
        int i=k-1;
        int h=A[i];
        A[i]=0;
        while (h >0)
            {
                i=i+1;
                if(i== n)
                {
                   i=0;
                   A[i]= A[i]+1;
                }
                else
                {
                    A[i]=A[i]+1;
                }

                h=h-1;

            }

        for(int j=0;j<n;j++)
        {
            System.out.format("%d ", A[j]);

        }
        System.out.print("\n");
    }

}