use std::io::{Read, stdin};

fn main() {
    let mut buf = String::new();
    stdin().read_to_string(&mut buf).unwrap();
    let mut tok = buf.split_whitespace();
    let mut get = || tok.next().unwrap();
    macro_rules! get {
        ($t:ty) => (get().parse::<$t>().unwrap());
        () => (get!(usize));
    }
    let n = get!();
    let k = get!();
    let mut ls = vec![];
    for _ in 0..k {
        ls.push(get!());
    }
    let mut grid = vec![];
    for _ in 0..n {
        let tmp: Vec<_> =
            get().as_bytes()
                 .iter()
                 .map(|&ch| (ch - b'0') as i32)
                 .collect();
        grid.push(tmp);
    }
    // println!("{:?}", grid);
    let mut ans = vec![];
    for &l in ls.iter() {
        let mut max_sum_i = 0;
        let mut max_sum_j = 0;
        let mut max_i = 0;
        let mut max_j = 0;
        for i in 0..n {
            let mut sum = 0;
            for j in 0..l {
                sum += grid[i][j];
            }
            if sum > max_sum_i {
                max_sum_i = sum;
                max_i = i;
            }
            let mut sum = 0;
            for j in 0..l {
                sum += grid[j][i];
            }
            if sum > max_sum_j {
                max_sum_j = sum;
                max_j = i;
            }
        }
        if max_sum_i >= max_sum_j {
            for j in 0..l {
                grid[max_i][j] = 1 - grid[max_i][j];
            }
            ans.push((true, max_i, l, 0));
        } else {
            for i in 0..l {
                grid[i][max_j] = 1 - grid[i][max_j];
            }
            ans.push((false, max_j, l, 0));
        }
    }
    for _ in 0..20 {
        let mut flag = true;
        for i in 0..ans.len() {
            let (b, j, l, p0) = ans[i];
            if b {
                for p in p0..p0+l {
                    grid[j][p] = 1 - grid[j][p];
                }
            } else {
                for p in p0..p0+l {
                    grid[p][j] = 1 - grid[p][j];
                }
            }
            let mut max_sum_i = 0;
            let mut max_i = 0;
            let mut max_i_p = 0;
            let mut max_sum_j = 0;
            let mut max_j = 0;
            let mut max_j_p = 0;
            for x in 0..n {
                for y in 0..n-l+1 {
                    let mut sum = 0;
                    for z in y..y+l {
                        sum += grid[x][z];
                    }
                    if sum > max_sum_i {
                        max_sum_i = sum;
                        max_i = x;
                        max_i_p = y;
                    }
                    let mut sum = 0;
                    for z in y..y+l {
                        sum += grid[z][x];
                    }
                    if sum >= max_sum_j {
                        max_sum_j = sum;
                        max_j = x;
                        max_j_p = y;
                    }
                }
            }
            let (b, j, p0) = if max_sum_i > max_sum_j {
                (true, max_i, max_i_p)
            } else {
                (false, max_j, max_j_p)
            };
            if b {
                for p in p0..p0+l {
                    grid[j][p] = 1 - grid[j][p];
                }
            } else {
                for p in p0..p0+l {
                    grid[p][j] = 1 - grid[p][j];
                }
            }
            let a = (b, j, l, p0);
            if ans[i] != a {
                ans[i] = a;
                flag = false;
            }
        }
        if flag { break; }
    }
    for &(b, i, l, p) in ans.iter() {
        if b {
            println!("{0} {1} {0} {2}", i + 1, p + 1, p + l);
        } else {
            println!("{1} {0} {2} {0}", i + 1, p + 1, p + l);
        }
    }
}