#include <fstream>
using namespace std;
long long int p[105];
long long int dp[105];
int main()
{
    ifstream in("pavare2.in");
    ofstream out("pavare2.out");
    int n,a,b,k;
    in>>n>>a>>b>>k;
    p[0]=1;
    for(int i=1;i<=n;++i)
        p[i]=p[i-1]*2;
    for(int i=1;i<=n;++i)
    {
        int r1=0,r2=0;
        dp[i]=dp[i-1]*2;
        if(i>=a+1)
            dp[i]+=p[i-a-1];
        if(i>=b+1)
            dp[i]+=p[i-b-1];
    }
    dp[n]=p[n]-dp[n];
    out<<dp[n]+1<<endl;
    if(k==1)
    {
        int ind=0,ca=0;
        while(ind<n)
        {
            ++ind;
            if(ca<a)
                out<<0,ca++;
            else out<<1,ca=0;
        }
    }

    return 0;
}