#include <iostream>
#include <list>
#include <vector>
#include <string>
#include <stdio.h>
#include <stdint.h>
#include <iomanip>
#include <algorithm>
using namespace std;

using ll = long long;

#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define FOR_LL( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR_LL( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;

template <typename T> inline T Distance( const T& a , const T& b ){ return a < b ? b - a : a - b; }

int main()
{

  GETLINE( dummy );
  constexpr const ll N = 60;
  constexpr const ll K = 500;
  constexpr const ll N2 = N * N;
  ll L[K] , Li , A[N2], i , j , k , l , a , a_bit , black = 0 , N_minus , black_current , black_min , black_preparation , down , j_min , k_min;
  i = 0;
  while( i < K ){
    cin >> l;
    L[i] = l;
    ++i;
  }
  sort( L , L + K );
  k = 0;
  while( k < N ){
    cin >> a;
    j = 0;
    l = ( k + 1 ) * N - 1;
    while( j < N ){
      a_bit = a % 2;
      a /= 2;
      A[ l - j ] = a_bit;
      black += a_bit;
      ++j;
    }
    ++k;
  }

  // １回ずつの最大化よりもラスト数回分纏めた最大化の方が
  // L[K-1]などが大きい時はスコアが上がるが、
  // 面倒なので１回ずつの最大化で諦める
  i = 0;
  while( i < K ){
    Li = L[i];
    N_minus = N - Li;
    black_preparation = black + Li;
    black_min = N2;
    j = 0;
    // down
    while( j < N ){
      k = 0;
      while( k < N_minus ){
	black_current = black_preparation;
	l = 0;
	while( l < Li ){
	  black_current -= A[ ( k + l ) * N + j ] * 2;
	  ++l;
	}
	if( black_current < black_min ){
	  black_min = black_current;
	  down = 1;
	  j_min = j;
	  k_min = k;
	}
	++k;
      }
      ++j;
    }
    k = 0;
    // right
    while( k < N ){
      j = 0;
      while( j < N_minus ){
	black_current = black_preparation;
	l = 0;
	while( l < Li ){
	  black_current -= A[ k * N + ( j + l ) ] * 2;
	  ++l;
	}
	if( black_current < black_min ){
	  black_min = black_current;
	  down = 0;
	  j_min = j;
	  k_min = k;
	}
	++j;
      }
      ++k;
    }
    black = black_min;
    l = 0;
    if( down == 1 ){
      while( l < Li ){
	A[ ( k_min + l ) * N + j_min ] = 1 - A[ ( k_min + l ) * N + j_min ];
	++l;
      }
      cout << k_min << " "  << j_min << " "  << k_min + Li - 1 << " "  << j_min << endl;
    } else {
      while( l < Li ){
	A[ k_min * N + ( j_min + l ) ] = 1 - A[ k_min * N + ( j_min + l ) ];
	++l;
      }
      cout << k_min << " "  << j_min << " "  << k_min << " "  << j_min + Li - 1 << endl;
    }
    ++i;
  }
  return 0;

}