#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <stack>
#include <climits>
#include <deque>
#include <bitset>
#include <cassert>
#include <ctime>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int dy[]={-1,0,1,0},dx[]={0,1,0,-1};
// adjust problem by problem
const double EPS=1e-8;
const double PI=acos(-1.0);
#define REP(i,n) for(int i=0;i<(int)n;++i)
#ifdef __GNUC__
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
int popcount(int n){return __builtin_popcount(n);}
int popcount(ll n){return __builtin_popcountll(n);}
#endif
#ifndef __GNUC__
template<class T> int popcount(T val){
  val = val - ((val >> 1) & 0x55555555);
  val = (val & 0x33333333) + ((val >> 2) & 0x33333333);
  val = (val + (val >> 4)) & 0x0f0f0f0f;
  val += val >> 8;
  val += val >> 16;
  return (int)(val & 0x0000003f);
}
#endif
template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> void PrintSeq(T &a,int sz){for(int i=0;i<sz;i++){cout<<a[i];if(sz==i+1)cout<<endl;else cout<<' ';}}
ll getTen(int a){return (a<=0)?1:(getTen(a-1)*10);}
bool EQ(double a,double b){return abs(a-b)<EPS;}
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
vector<string> split(string str,char del){
  vector<string> res;
  for(int i=0,s=0;i<SIZE(str);i++){
    if(str[i]==del){if(i-s!=0)res.push_back(str.substr(s,i-s));s=i+1;}
    else if(i==SIZE(str)-1){res.push_back(str.substr(s));}
  }
  return res;
}


int N,M;
int L[2001];
bool dp[1001][1<<12];
pii tos[1001][1<<12];
int main(){

  while(cin>>N>>M&&(N|M)){
    for(int i=0;i<N;i++)cin>>L[i];
    const int delOverBitMask=((1<<M)-1);
    for(int i=N;i>=0;i--){
      for(int mask=0;mask<(1<<M);mask++){
        bool res=false;
        if(i==N)res=true;
        else{
          if(popcount(mask)==L[i]){
            int nmask=(mask<<1)&delOverBitMask;
            res|=dp[i+1][nmask];
            if(dp[i+1][nmask])tos[i][mask]=pii(i+1,nmask);
            nmask|=1;
            res|=dp[i+1][nmask];
            if(dp[i+1][nmask])tos[i][mask]=pii(i+1,nmask);
          }
        }
        dp[i][mask]=res;
      }
    }
    // 条件を満たす開始posを探す
    for(int smask=0;smask<(1<<M);smask++){
      if(dp[0][smask]){
        int cpos=0;
        int cmask=smask;
        for(int i=M-1;i>=1;i--)cout<<((smask>>i)&1);
        while(cpos<=N-1){
          cout<<(cmask&1);
          pii to=tos[cpos][cmask];
          cpos=to.first;
          cmask=to.second;
        }
        cout<<endl;
        break;
      }
      if(smask==(1<<M)-1)cout<<"Goofy"<<endl;
    }
  }
  
  return 0;
}