#include <bits/stdc++.h>   using namespace std;   void __print(int x) { cerr << x; }   void __print(long x) { cerr << x; }   void __print(long long x) { cerr << x; }   void __print(unsigned x) { cerr << x; }   void __print(unsigned long x) { cerr << x; }   void __print(unsigned long long x) { cerr << x; }   void __print(float x) { cerr << x; }   void __print(double x) { cerr << x; }   void __print(long double x) { cerr << x; }   void __print(char x) { cerr <<      << x <<     ; }   void __print(const char *x) { cerr <<     << x <<    ; }   void __print(const string &x) { cerr <<     << x <<    ; }   void __print(bool x) { cerr << (x ?  true  :  false ); }   template <typename T, typename V>   void __print(const pair<T, V> &x) {     cerr <<  { ;     __print(x.first);     cerr <<  , ;     __print(x.second);     cerr <<  } ;   }   template <typename T>   void __print(const T &x) {     int f = 0;     cerr <<  { ;     for (auto &i : x) cerr << (f++ ?  ,  :   ), __print(i);     cerr <<  } ;   }   void _print() { cerr <<  ] n ; }   template <typename T, typename... V>   void _print(T t, V... v) {     __print(t);     if (sizeof...(v)) cerr <<  ,  ;     _print(v...);   }   const int SIZE = 2e5 + 5;   const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};   const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};   void fastio() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);   }   void solveTest() {     long long n, m;     cin >> n >> m;     --m;     vector<long long> a(n);     long long mn = INT_MAX;     for (int i = 0; i < n; i++) {       cin >> a[i];       mn = min(mn, a[i]);     }     for (int i = 0; i < n; i++) {       a[i] -= mn;     }     long long cnt = (1ll * mn) * n;     while (a[m] != 0) {       a[m]--;       cnt++;       if (m == 0)         m = n - 1;       else         m--;     }     a[m] = cnt;     for (int i = 0; i < n; i++) {       cout << a[i] <<    ;     }     return;   }   int main() {     fastio();     int t = 1;     while (t--) {       solveTest();     }     return 0;   }   