cf1809e(edu145e)

/*
                   _ooOoo_
                  o8888888o
                  88" . "88
                  (| -_- |)
                  O\  =  /O
               ____/`---'\____
             .'  \\|     |//  `.
            /  \\|||  :  |||//  \
           /  _||||| -:- |||||-  \
           |   | \\\  -  /// |   |
           | \_|  ''\---/''  |   |
           \  .-\__  `-`  ___/-. /
         ___`. .'  /--.--\  `. . __
      ."" '<  `.___\_<|>_/___.'  >'"".
     | | :  `- \`.;`\ _ /`;.`/ - ` : | |
     \  \ `-.   \_ __\ /__ _/   .-` /  /
======`-.____`-.___\_____/___.-`____.-'======
                   `=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
        AC 护体 
*/

#include <bits/stdc++.h>
#define for_(i,a,b) for (int i = (a); i < (b); i++)
#define rep_(i,a,b) for (int i = (a); i <= (b); i++)
#define per_(i,a,b) for (int i = (a); i >= (b); i--)
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(v) v.begin(), v.end()
#define ull unsigned long long
#define pb push_back
#define CE cout << endl;
#define CO cout << "OK" << endl;
#define D DEBUG
#define DEBUG(x) cerr << #x << '=' << x << endl
#define endl '\n'
using namespace std;
const int maxn = 5e5 + 10, mod = 998244353;// mod = 1949777;
const double EPS = 1e-3;
int n, m, a, b;
int ans[1005][1005]; 
signed main() {
    #ifdef LOCAL
        freopen("w.in", "r", stdin);
        //freopen("w.ans", "w", stdout);
    #endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //int tt; cin >> tt; while(tt--) solve();
    cin >> n >> a >> b;
    vector<int> v(n);
    rep_(i, 0, n - 1) cin >> v[i];
    rep_(i, 0, a + b) {
        int x = max(0, i - b), y = min(i, a); // 水量总和为i时水箱1的上下界 
        int lo = x, hi = y; 
        per_(j, n - 1, 0) {
            lo = max(lo + v[j], x);
            hi = min(hi + v[j], y);
        }//从水箱1的上下界从后往前，把倒水的过程逆过去，得出有影响的水的上下界 
        int flo = lo, fhi = hi;
        rep_(j, 0, n - 1) {  
            flo = max(min(flo - v[j], y), x);
            fhi = min(max(fhi - v[j], x), y);
        } // 从有影响的水的上下界从前往后模拟倒水，得出答案的水的上下界 
        rep_(j, x, y) {
            int d = i - j;
            if (j <= lo) {
                ans[j][d] = flo; //水箱1水太少，对答案贡献是下界flo 
            } else if (j >= hi) {
                ans[j][d] = fhi;//太多 
            } else {
                ans[j][d] = flo + j - lo;
                //处于有影响范围 
            }
        }
    }
    rep_(i, 0, a) {
        rep_(j, 0, b) {
            cout << ans[i][j] << ' ';
        }
        cout << endl;
    }
    return 0;
}