#pragma GCC optimize ("O3")
//#pragma GCC target ("avx")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }

struct XorShift {
    using result_type = uint64_t;
    result_type x_;
    XorShift(result_type x = 88172645463325252ull) :x_(x) {};
    static constexpr inline result_type min() { return 0ull; }
    static constexpr inline result_type max() { return numeric_limits<result_type>::max(); }
    inline result_type operator()() { x_ ^= x_ << 7; return x_ ^= x_ >> 9; }
    inline void discard(unsigned long long z) { while (z--) operator()(); }
};
XorShift randdev;
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())




class DGraphF {
public:
    typedef int cap_t;
    size_t n_;
    struct Arc {
        int from, to;
        // 残量
        cap_t left;
        // 容量
        cap_t cap;

        Arc(int from = 0, int to = 0, cap_t w = 1) :from(from), to(to), left(w), cap(w) {}
        inline bool operator<(const Arc& a) const { return (left != a.left) ? left < a.left : (left<a.left) | (cap<a.cap) | (from<a.from) | (to<a.to); }
        inline bool operator==(const Arc& a) const { return (from == a.from) && (to == a.to) && (left == a.left) && (cap == a.cap); }
    };
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;
    vector<Arc> edges;

    DGraphF(int n = 1) :n_(n), vertex_to(n), vertex_from(n) { }

    void connect(int from, int to, cap_t left) {
        vertex_to[(size_t)from].push_back((int)edges.size()); // toto
        vertex_from[(size_t)to].push_back((int)edges.size()); // fromfrom
        edges.emplace_back(from, to, left);
    }
};



void dinic(DGraphF &graph, vector<DGraphF::cap_t>& result, int i_source, int i_sink) {
    assert(i_source != i_sink);

    result.resize(graph.n_);
    vector<int> dist(graph.n_);
    queue<int> q;
    vector<int> flag(graph.n_);

    static function<DGraphF::cap_t(int, int, DGraphF::cap_t)> _dfs = [&](int u, int i_sink, DGraphF::cap_t mini) {
        // DAG
        // TODO: 経路再利用
        if (i_sink == u) return mini;
        if (flag[u]) return (DGraphF::cap_t) - 1;
        flag[u] = true;

        DGraphF::cap_t sumw = 0;
        bool term = true;
        for (int e : graph.vertex_to[u]) {
            auto& edge = graph.edges[e];
            if (edge.left > 0 && dist[u]>dist[edge.to]) {
                DGraphF::cap_t w = (mini < 0) ? edge.left : min(edge.left, mini);

                w = _dfs(edge.to, i_sink, w);
                if (w == -1) continue;
                edge.left -= w;
                result[edge.to] += w;

                sumw += w;
                mini -= w;
                term = false;
                flag[u] = false; // TODO: 末尾では? 

                if (mini == 0) return sumw;
            }
        }
        for (int e : graph.vertex_from[u]) {
            auto& edge = graph.edges[e];
            if (edge.cap>edge.left && dist[u]>dist[edge.from]) {
                DGraphF::cap_t w = (mini < 0) ? (edge.cap - edge.left) : min(edge.cap - edge.left, mini);

                w = _dfs(edge.from, i_sink, w);
                if (w == -1) continue;
                edge.left += w;
                result[edge.to] -= w;

                sumw += w;
                mini -= w;
                term = false;
                flag[u] = false;
                if (mini == 0) return sumw;
            }
        }
        return term ? (DGraphF::cap_t)(-1) : sumw;
    };


    for (int distbegin = 0; ; distbegin += (int)graph.n_) {

        q.emplace(i_sink); // bfsはsinkからsourceへの距離を計算．
        dist[i_sink] = distbegin + 1;
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int ie : graph.vertex_from[v]) {
                const auto edge = graph.edges[ie];
                if (0 < edge.left && dist[edge.from] <= distbegin) {
                    dist[edge.from] = dist[v] + 1;
                    q.emplace(edge.from);
                }
            }
            for (int ie : graph.vertex_to[v]) {
                const auto edge = graph.edges[ie];
                if (edge.left < edge.cap && dist[edge.to] <= distbegin) {
                    dist[edge.to] = dist[v] + 1;
                    q.emplace(edge.to);
                }
            }
        }
        fill(flag.begin(), flag.end(), false);

        if (dist[i_source] <= distbegin)
            break;
        else
            result[i_source] += _dfs(i_source, i_sink, -1);
    }
}



// Rectangle
struct Rect {
    int top, left, bottom, right;
    Rect(int t = 0, int l = 0, int b = 0, int r = 0) :top(t), left(l), bottom(b), right(r) { }
    inline int area() { return (right - left + 1)*(bottom - top + 1); }
    inline bool operator==(Rect r) const { return top == r.top&&left == r.left&&bottom == r.bottom&&right == r.right; }
    inline bool operator<(Rect r) const { return make_tuple(top, left, bottom, right) < make_tuple(r.top, r.left, r.bottom, r.right); }
};



auto beginTime = TIME;



// 問題文と入力
const int N = 60, K = 500;
int L[K], A[N][N];
const int Lmax = 25;

// 長さiの長方形のインデックス
// L[j]=iであるようなjの集合が格納される．
vector<int> idxsL[Lmax + 1];

//
vector<Rect> result[Lmax + 1];


// workspace
int my_A[N][N];


inline void apply(int f[N][N], Rect r) {
    iterate(y, r.top, r.bottom + 1)
        iterate(x, r.left, r.right + 1)
        f[y][x] ^= 1;
}



// 
void input() {

    int n, k;
    scanner >> n >> k;
    assert(n == N && k == K);
    scanner.in(L, L + K);
    repeat(i, N) {
        string str; scanner >> str;
        repeat(j, N) A[i][j] = str[j] == '0'; // << ============== スコア最小を目指す
    }

    // - - - - -

    repeat(i, K)
        idxsL[L[i]].push_back(i);
}



//
void solve() {

    repeat(y, N) repeat(x, N) my_A[y][x] = A[y][x];// <<<突然のRE復活>>> copy(A[0], A[N], my_A[N]);

    int sum[N][N + 1];

    // l in 3..Lmax
    diterate(l, Lmax, 2) {
        repeat(_, idxsL[l].size()) {

            int best_score = -1;
            Rect best_rect;
            decltype(randdev()) best_seed;

            // 水平方向に置く場合を全探索
            // 累積和
            repeat(y, N) {
                sum[y][0] = 0;
                repeat(x, N)
                    sum[y][x + 1] = sum[y][x] + my_A[y][x];
            }
            // 探索
            repeat(y, N) repeat(x, N + 1 - l) {
                int score = sum[y][x + l] - sum[y][x] + (my_A[y][x] * my_A[y][x + l - 1]) * 5;
                if (best_score < score || (best_score == score && randdev() & 1))
                    best_score = score,
                    best_rect = Rect(y, x, y, x + l - 1);
            }

            // 垂直方向に置く場合を全探索
            // 累積和
            repeat(x, N) {
                sum[x][0] = 0;
                repeat(y, N)
                    sum[x][y + 1] = sum[x][y] + my_A[y][x];
            }
            // 探索
            repeat(x, N) repeat(y, N + 1 - l) {
                int score = sum[x][y + l] - sum[x][y] + (my_A[y][x] * my_A[y + l - 1][x]) * 5;
                if (best_score < score || (best_score == score && best_seed < randdev()))
                    best_score = score,
                    best_rect = Rect(y, x, y + l - 1, x),
                    best_seed = randdev();
            }


            result[l].push_back(best_rect);

            apply(my_A, best_rect);
        }
    }
    // l in 2
    {
        const int l = 2;
        repeat(_, idxsL[l].size()) {

            int best_score = -1;
            Rect best_rect;

            // 水平方向に置く場合を全探索
            // 探索
            repeat(y, N) repeat(x, N + 1 - l) {
                int score = 0;
                repeat(i, l) score += my_A[y][x + i];
                if (best_score < score || (best_score == score && randdev() & 1))
                    best_score = score,
                    best_rect = Rect(y, x, y, x + l - 1);
            }

            // 垂直方向に置く場合を全探索
            // 探索
            repeat(x, N) repeat(y, N + 1 - l) {
                int score = 0;
                repeat(i, l) score += my_A[y + i][x];
                if (best_score < score || (best_score == score && randdev() & 1))
                    best_score = score,
                    best_rect = Rect(y, x, y + l - 1, x);
            }

            result[l].push_back(best_rect);

            apply(my_A, best_rect);
        }
    }

    // 調整

    diterate(l, Lmax, 1) {
        for (Rect& rect : result[l]) {
            if (rect.left == rect.right) {
                int y = rect.top;
                if (0 < rect.left && my_A[y][rect.left - 1] == 1 && my_A[y][rect.right] == 1)
                    --rect.left, --rect.right;
                else if (rect.right < N - 1 && my_A[y][rect.left] == 1 && my_A[y][rect.right + 1] == 1)
                    ++rect.left, ++rect.right;
            }else if (rect.top == rect.bottom) {
                int x = rect.left;
                if (0 < rect.top && my_A[rect.top - 1][x] == 1 && my_A[rect.bottom][x] == 1)
                    --rect.top, --rect.bottom;
                else if (rect.bottom < N - 1 && my_A[rect.top][x] == 1 && my_A[rect.bottom + 1][x] == 1)
                    ++rect.top, ++rect.bottom;
            }
        }
    }
}



//
void burning_stage() {
    return; //

    //while (MILLISEC(TIME - beginTime) < 960)
    {
        vector<pair<int, int>> alist; // <y,x>
        repeat(y, N) {
            repeat(x, N) {
                if (my_A[y][x]) alist.emplace_back(y, x);
            }
        }
        if (alist.size() <= 4) return; // nice!!!

        vector<pair<int, int>> shorter, longer; // <idx, 
    }

}



//
void solve_one(){

    // l in 1
    {
        const int l = 1;
        {
            int cnt = idxsL[1].size();

            Rect best_rect;

            // 探索
            repeat(y, N) repeat(x, N) {
                int score = 0;
                if (my_A[y][x]) {
                    result[1].push_back(Rect(y, x, y, x));
                    // apply(my_A, best_rect);
                    if (--cnt <= 0) {
                        y = N, x = N; break;
                    }
                }
            }

        }
    }
}



//
void output() {

    vector<Rect> answer(K);

    iterate(l, 1, Lmax + 1) repeat(i, idxsL[l].size()) {
        answer[idxsL[l][i]] = result[l][i];
    }

    for (Rect r : answer)
        printf("%d %d %d %d\n", r.top + 1, r.left + 1, r.bottom + 1, r.right + 1);

}



int main() {

    input();
    solve();
    burning_stage();
    solve_one();
    output();



    return 0;
}