#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int B = 100;
  int n, m; cin >> n >> m;
  bitset<B> x; cin >> x;
  vector<bitset<B>> a(n + 1, 0);
  FOR(i, 1, n + 1) cin >> a[i];
  vector<vector<int>> ans;
  const auto tmp = [&]() -> int {
    const int idx = a.size();
    a.emplace_back(0);
    return idx;
  };
  const auto NAND = [&](int x, int i, int j) -> void {
    ans.emplace_back(vector<int>{2, x, i, i});
    a[x] = ~(a[i] & a[j]);
  };
  const auto NOT = [&](int x, int i) -> void {
    NAND(x, i, i);
  };
  const auto AND = [&](int x, int i, int j) -> void {
    const int p = tmp();
    NAND(p, i, j);
    NOT(x, p);
  };
  const auto OR = [&](int x, int i, int j) -> void {
    const int p = tmp(), q = tmp();
    NOT(p, i);
    NOT(q, j);
    NAND(x, p, q);
  };
  const auto XOR = [&](int x, int i, int j) -> void {
    const int p = tmp(), q = tmp();
    NAND(p, i, j);
    OR(q, i, j);
    AND(x, p, q);
  };
  const auto SHIFT = [&](int x, int i) -> void {
    ans.emplace_back(vector<int>{1, x, i});
    a[x] = a[i] << 1;
  };
  const int idx = tmp();
  NOT(idx, idx);
  REP(b, m) {
    if (x[b] ^ a[0][b]) XOR(0, 0, idx);
    SHIFT(idx, idx);
  }
  const int k = ans.size();
  cout << k << '\n';
  assert(k <= 1000);
  for (const vector<int>& op : ans) {
    REP(i, op.size()) cout << op[i] << " \n"[i + 1 == op.size()];
  }
  cout << a[0] << '\n';
  return 0;
}