#include int main() { int i, N, M; char X[101], A[101][101]; scanf("%d %d", &N, &M); scanf("%s", X); for (i = 1; i <= N; i++) scanf("%s", A[i]); int k = 5, ans[1001][4]; ans[0][0] = 2; ans[0][1] = 1; ans[0][2] = 0; ans[0][3] = 0; ans[1][0] = 1; ans[1][1] = 2; ans[1][2] = 1; ans[2][0] = 1; ans[2][1] = 1; ans[2][2] = 1; ans[3][0] = 2; ans[3][1] = 1; ans[3][2] = 1; ans[3][3] = 1; ans[4][0] = 2; ans[4][1] = 0; ans[4][2] = 0; ans[4][3] = 0; for (i = 0; i < M; i++) { if (X[M-i-1] == '0') { ans[k][0] = 2; ans[k][1] = 0; ans[k][2] = 0; ans[k++][3] = 1; } ans[k][0] = 1; ans[k][1] = 1; ans[k++][2] = 1; } printf("%d\n", k); for (i = 0; i < k; i++) { if (ans[i][0] == 1) printf("1 %d %d\n", ans[i][1], ans[i][2]); else printf("2 %d %d %d\n", ans[i][1], ans[i][2], ans[i][3]); } fflush(stdout); return 0; }