import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const X = readToken;
      auto A = new string[N];
      foreach (i; 0 .. N) {
        A[i] = readToken;
      }
      
      int[][] ans;
      int id = N;
      int ZERO() {
        ++id;
        return id;
      }
      int SHIFT(int u) {
        ++id;
        ans ~= [1, id, u];
        return id;
      }
      int NAND(int u, int v) {
        ++id;
        ans ~= [2, id, u, v];
        return id;
      }
      int NOT(int u) {
        return NAND(u, u);
      }
      int AND(int u, int v) {
        return NOT(NAND(u, v));
      }
      int OR(int u, int v) {
        return NAND(NOT(u), NOT(v));
      }
      
      auto fs = new int[M + 1];
      fs[0] = NOT(ZERO());
      foreach (e; 0 .. M) {
        fs[e + 1] = SHIFT(fs[e]);
      }
      auto gs = new int[M + 1];
      foreach (e; 0 .. M + 1) {
        gs[e] = NOT(fs[e]);
      }
      auto two = new int[M];
      foreach (e; 0 .. M) {
        two[e] = AND(fs[e], gs[e + 1]);
      }
      
      int sum = ZERO();
      foreach (e; 0 .. M) {
        if (X[M - 1 - e] == '1') {
          sum = OR(sum, two[e]);
        }
      }
      assert(ans[$ - 1][1] == sum);
      ans[$ - 1][1] = 0;
      
      writeln(ans.length);
      foreach (op; ans) {
        foreach (index, o; op) {
          if (index) write(" ");
          write(o);
        }
        writeln;
      }
    }
  } catch (EOFException e) {
  }
}