#include <bits/stdc++.h>
using namespace std;
#define fio                         \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);                    \
cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define ld long double
#define endl "\n"
#define ff first
#define ss second
#define pi pair<ll, ll>
#define PI 3.141592653589793238462643383279502884L
#define mp make_pair
#define pb push_back
#define sz(x) (ll) x.size()
#define all(x) x.begin(), x.end()
#define time_passed 1.0 * clock() / CLOCKS_PER_SEC
ll MOD = 1e9 + 7;
ll MOD1 = 1e9 + 123;
ll MOD2 = 1e9 + 321;

int main()
{
    fio;
    ll t, a, n, q, k, i, l, m, c, u, f, j, p, r, x, y, s, b, d;
    ll sx, sy, tx, ty;
cin>>sx>>sy>>tx>>ty;
    for (i=0;i<tx-sx;i++)
        cout<<'R';

    for (i=0;i<ty-sy;i++)
        cout<<'U';
    for (i=0;i<tx-sx;i++)
        cout<<'L';

    for (i=0;i<ty-sy;i++)
        cout<<'D';
    cout<<'D';
    for (i=0;i<tx-sx+1;i++)
        cout<<'R';

    for (i=0;i<ty-sy+1;i++)
        cout<<'U';
    cout<<'L';
    cout<<'U';
    for (i=0;i<tx-sx+1;i++)
        cout<<'L';

    for (i=0;i<ty-sy+1;i++)
        cout<<'D';

    cout<<'R';

    return 0;
}

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>; 
using pll = pair<long long, long long>;
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rept(i, j, n) for(int i=(j); i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }


int main(){
     int n, k; cin >> n >> k;
     vector<int> A(n); rep(i, n) cin >> A[i];

     rep(i, min(2000, k)){
         vector<int> imos(n+1);
         rep(j, n){
             int s = max(0, j - A[j]), g = min(n, j + A[j] + 1);
             imos[s]++;
             imos[g]--;
         }
         rep(j, n){
             if(j)A[j] = A[j-1]; else A[j] = 0;
             A[j] += imos[j];
         }
     }
     rep(i, n)cout << A[i] << " ";
     cout << ln;
}
    

 
