#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int N = 60;
int K;

int A[N][N];
vector<int> L;

int main() {
  int _N;
  cin >> _N >> K;

  L.reserve(K);
  for (int i = 0; i < K; ++i) {
    cin >> L[i];
  }

  for (int y = 0; y < N; ++y) {
    string row;
    cin >> row;

    for (int x = 0; x < N; ++x) {
      int v = row[x] - '0';
      A[y][x] = v;
    }
  }

  for (int i = 0; i < K; ++i) {
    cout << "1 1 1 " << L[i] << endl;
  }

  return 0;
}