#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned int;
#define rep(i,n) for(int i=0; i<(n); i++)


bool is_piriodic(const string& s, int k){
    int n = s.size();
    for(int i=0; i<n; i++) if(s[i] != s[(i+k)%n]) return false;
    return true;
}



int main() {
    int N,M; cin >> N >> M;
    string X; cin >> X;
    vector<string> A(N);
    rep(i,N) cin >> A[i];

    vector<vector<int>> ans;

    auto query_shift = [&](int o, int i) -> void {
        ans.push_back({ 1, o, i });
    };
    auto query_nand = [&](int o, int a, int b) -> void {
        ans.push_back({ 2, o, a, b });
    };

    query_nand(0,0,0);

    reverse(X.begin(), X.end());

    int Z = 7001;
    query_nand(Z,Z,Z);
    query_shift(Z,Z);
    rep(i,M){
        if(X[i] == '1'){
            query_nand(0,0,Z);
            query_nand(0,0,0);
        }
        query_nand(Z,Z,Z);
        query_shift(Z,Z);
        query_nand(Z,Z,Z);
    }
    query_nand(0,0,0);

    cout << ans.size() << "\n";
    for(auto& a : ans){
        rep(i,a.size()){
            if(i) cout << " ";
            cout << a[i];
        }
        cout << "\n";
    }

    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;