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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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 L = readInt;
      const Q = readInt;
      const X = readInt;
      const Y = readInt;
      auto K = new BigInt[Q];
      foreach (q; 0 .. Q) {
        K[q] = BigInt(readToken);
      }
      
      const maxK = K.maxElement;
      int E;
      BigInt[] fs;
      {
        BigInt a = 1, b = 1;
        for (; ; ) {
          ++E;
          fs ~= a;
          fs ~= b;
          if (b > maxK) break;
          a += b;
          b += a;
        }
      }
      debug {
        writeln("E = ", E);
        writeln("fs = ", fs);
      }
      
      alias Pt = Tuple!(int, "x", int, "y");
      Pt[] ps;
      int[] ids;
      foreach (e; 0 .. E) {
        ids ~= cast(int)(ps.length);
        ps ~= Pt(e + 0, e + 0);
        ids ~= cast(int)(ps.length);
        ps ~= Pt(e + 0, e + 1);
        ps ~= Pt(e + 0, e + 2);
        ps ~= Pt(e + 1, e + 0);
      }
      
      writeln(ps.length);
      foreach (p; ps) {
        writeln(p.x + 1, " ", p.y + 1);
      }
      foreach (q; 0 .. Q) {
        auto ans = new char[ps.length];
        ans[] = '0';
        BigInt k = K[q];
        foreach_reverse (i; 0 .. cast(int)(fs.length)) {
          if (k >= fs[i]) {
            k -= fs[i];
            ans[ids[i]] = '1';
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}