//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const string zzz[]={
"0000",
"1110",
"0011",
"1101",
"0110",
"1000",
"0101",
"1011",
"1100",
"0010",
"1111",
"0001",
"1010",
"0100",
"1001",
"0111"
};
int n,k,t;
string s;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>k>>t;
cin>>s;
if (k%2==0){
cout<<"-1"<<endl;
return 0;
}
int idx;
rep(x,0,16) if (zzz[x]==s) idx=x;
cout<<16<<endl;
rep(x,0,16) cout<<zzz[(x+idx)%16]<<endl;
}
