#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
 
int n, m, tar;
bool a[10][10];
set<string> seen;
 
string to_string_matrix(bool mat[10][10]) {
    string res;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            res += a[i][j] ? '1' : '0';
        }
    }
    return res;
}
 
string rotate_90(const string &s) {
    string t(n * m, '0');
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            t[j * n + (n - 1 - i)] = s[i * m + j];
        }
    }
    return t;
}
 
string reflect_h(const string &s) {
    string t = s;
    for (int i = 0; i < n; i++) {
        reverse(t.begin() + i * m, t.begin() + (i + 1) * m);
    }
    return t;
}
 
string reflect_v(const string &s) {
    string t = s;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            t[(n - 1 - i) * m + j] = s[i * m + j];
        }
    }
    return t;
}
 
string min_representation(string s) {
    vector<string> variants;
    variants.push_back(s);
    variants.push_back(reflect_h(s));
    variants.push_back(reflect_v(s));
 
 
    string r = rotate_90(s);
    variants.push_back(r);
    variants.push_back(reflect_h(r));
    variants.push_back(reflect_v(r));
 
    r = rotate_90(r);
    variants.push_back(r);
    variants.push_back(reflect_h(r));
    variants.push_back(reflect_v(r));
 
    return *min_element(variants.begin(), variants.end());
}
 
bool check() {
    for (int d = 1; d <= min(n, m) - 1; d++) {
        for (int i = 0; i + d < n; i++) {
            for (int j = 0; j + d < m; j++) {
                if (a[i][j] && a[i + d][j] && a[i][j + d] && a[i + d][j + d]) {
                    return false;
                }
            }
        }
    }
    return true;
}
 
int valid_count = 0;
 
void dfs(int i, int j, int k) {
    if (j == m) {
        i++;
        j = 0;
    }
 
    if (i == n) {
        if (k == tar && check()) {
            string key = to_string_matrix(a);
            string rep = min_representation(key);
            if (seen.count(rep)) return; // 對稱解出現過就跳過
 
            seen.insert(rep);
            valid_count++;
 
            for (int x = 0; x < n; x++) {
                for (int y = 0; y < m; y++) {
                    cout << a[x][y] << " ";
                }
                cout << "\n";
            }
            cout << "--------\n";
        }
        return;
    }
 
    a[i][j] = 0;
    dfs(i, j + 1, k);
 
    if (k < tar) {
        a[i][j] = 1;
        dfs(i, j + 1, k + 1);
    }
}
 
int main() {
    cin >> n >> m >> tar;
    dfs(0, 0, 0);
    cout << "合法代表組合總數: " << valid_count << "\n";
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c2V0PgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG4sIG0sIHRhcjsKYm9vbCBhWzEwXVsxMF07CnNldDxzdHJpbmc+IHNlZW47CgpzdHJpbmcgdG9fc3RyaW5nX21hdHJpeChib29sIG1hdFsxMF1bMTBdKSB7CiAgICBzdHJpbmcgcmVzOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBmb3IgKGludCBqID0gMDsgaiA8IG07IGorKykgewogICAgICAgICAgICByZXMgKz0gYVtpXVtqXSA/ICcxJyA6ICcwJzsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gcmVzOwp9CgpzdHJpbmcgcm90YXRlXzkwKGNvbnN0IHN0cmluZyAmcykgewogICAgc3RyaW5nIHQobiAqIG0sICcwJyk7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgbTsgaisrKSB7CiAgICAgICAgICAgIHRbaiAqIG4gKyAobiAtIDEgLSBpKV0gPSBzW2kgKiBtICsgal07CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIHQ7Cn0KCnN0cmluZyByZWZsZWN0X2goY29uc3Qgc3RyaW5nICZzKSB7CiAgICBzdHJpbmcgdCA9IHM7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIHJldmVyc2UodC5iZWdpbigpICsgaSAqIG0sIHQuYmVnaW4oKSArIChpICsgMSkgKiBtKTsKICAgIH0KICAgIHJldHVybiB0Owp9CgpzdHJpbmcgcmVmbGVjdF92KGNvbnN0IHN0cmluZyAmcykgewogICAgc3RyaW5nIHQgPSBzOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBmb3IgKGludCBqID0gMDsgaiA8IG07IGorKykgewogICAgICAgICAgICB0WyhuIC0gMSAtIGkpICogbSArIGpdID0gc1tpICogbSArIGpdOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiB0Owp9CgpzdHJpbmcgbWluX3JlcHJlc2VudGF0aW9uKHN0cmluZyBzKSB7CiAgICB2ZWN0b3I8c3RyaW5nPiB2YXJpYW50czsKICAgIHZhcmlhbnRzLnB1c2hfYmFjayhzKTsKICAgIHZhcmlhbnRzLnB1c2hfYmFjayhyZWZsZWN0X2gocykpOwogICAgdmFyaWFudHMucHVzaF9iYWNrKHJlZmxlY3RfdihzKSk7CgoKICAgIHN0cmluZyByID0gcm90YXRlXzkwKHMpOwogICAgdmFyaWFudHMucHVzaF9iYWNrKHIpOwogICAgdmFyaWFudHMucHVzaF9iYWNrKHJlZmxlY3RfaChyKSk7CiAgICB2YXJpYW50cy5wdXNoX2JhY2socmVmbGVjdF92KHIpKTsKCiAgICByID0gcm90YXRlXzkwKHIpOwogICAgdmFyaWFudHMucHVzaF9iYWNrKHIpOwogICAgdmFyaWFudHMucHVzaF9iYWNrKHJlZmxlY3RfaChyKSk7CiAgICB2YXJpYW50cy5wdXNoX2JhY2socmVmbGVjdF92KHIpKTsKCiAgICByZXR1cm4gKm1pbl9lbGVtZW50KHZhcmlhbnRzLmJlZ2luKCksIHZhcmlhbnRzLmVuZCgpKTsKfQoKYm9vbCBjaGVjaygpIHsKICAgIGZvciAoaW50IGQgPSAxOyBkIDw9IG1pbihuLCBtKSAtIDE7IGQrKykgewogICAgICAgIGZvciAoaW50IGkgPSAwOyBpICsgZCA8IG47IGkrKykgewogICAgICAgICAgICBmb3IgKGludCBqID0gMDsgaiArIGQgPCBtOyBqKyspIHsKICAgICAgICAgICAgICAgIGlmIChhW2ldW2pdICYmIGFbaSArIGRdW2pdICYmIGFbaV1baiArIGRdICYmIGFbaSArIGRdW2ogKyBkXSkgewogICAgICAgICAgICAgICAgICAgIHJldHVybiBmYWxzZTsKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KICAgIHJldHVybiB0cnVlOwp9CgppbnQgdmFsaWRfY291bnQgPSAwOwoKdm9pZCBkZnMoaW50IGksIGludCBqLCBpbnQgaykgewogICAgaWYgKGogPT0gbSkgewogICAgICAgIGkrKzsKICAgICAgICBqID0gMDsKICAgIH0KCiAgICBpZiAoaSA9PSBuKSB7CiAgICAgICAgaWYgKGsgPT0gdGFyICYmIGNoZWNrKCkpIHsKICAgICAgICAgICAgc3RyaW5nIGtleSA9IHRvX3N0cmluZ19tYXRyaXgoYSk7CiAgICAgICAgICAgIHN0cmluZyByZXAgPSBtaW5fcmVwcmVzZW50YXRpb24oa2V5KTsKICAgICAgICAgICAgaWYgKHNlZW4uY291bnQocmVwKSkgcmV0dXJuOyAvLyDlsI3nqLHop6Plh7rnj77pgY7lsLHot7PpgY4KCiAgICAgICAgICAgIHNlZW4uaW5zZXJ0KHJlcCk7CiAgICAgICAgICAgIHZhbGlkX2NvdW50Kys7CgogICAgICAgICAgICBmb3IgKGludCB4ID0gMDsgeCA8IG47IHgrKykgewogICAgICAgICAgICAgICAgZm9yIChpbnQgeSA9IDA7IHkgPCBtOyB5KyspIHsKICAgICAgICAgICAgICAgICAgICBjb3V0IDw8IGFbeF1beV0gPDwgIiAiOwogICAgICAgICAgICAgICAgfQogICAgICAgICAgICAgICAgY291dCA8PCAiXG4iOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGNvdXQgPDwgIi0tLS0tLS0tXG4iOwogICAgICAgIH0KICAgICAgICByZXR1cm47CiAgICB9CgogICAgYVtpXVtqXSA9IDA7CiAgICBkZnMoaSwgaiArIDEsIGspOwoKICAgIGlmIChrIDwgdGFyKSB7CiAgICAgICAgYVtpXVtqXSA9IDE7CiAgICAgICAgZGZzKGksIGogKyAxLCBrICsgMSk7CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgY2luID4+IG4gPj4gbSA+PiB0YXI7CiAgICBkZnMoMCwgMCwgMCk7CiAgICBjb3V0IDw8ICLlkIjms5Xku6PooajntYTlkIjnuL3mlbg6ICIgPDwgdmFsaWRfY291bnQgPDwgIlxuIjsKfQo=

NCA1IDE0Cg==

4 5 14