#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10,M=110;

int n,m,a[N],cnt[N];
vector<int> ans;

int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        cnt[a[i]&1]++;
    }
    if(m==1){
        if(a[1]==1)printf("1\n1\n1\n");
        else printf("%d\n2\n%d %d\n",a[1],1,a[1]-1);
        return 0;
    }
    if(cnt[1]>2)return puts("Impossible"),0;
    
    sort(a+1,a+m+1,[&](int x,int y){
        return x%2>y%2;
    });

    printf("%d\n",a[1]);
    for(int i=3;i<=m;i++)printf("%d ",a[i]);
    printf("%d ",a[2]);
    ans.emplace_back(a[1]+1);
    for(int i=3;i<=m;i++)ans.emplace_back(a[i]);
    if(a[2]>1)ans.emplace_back(a[2]-1);
    printf("%d\n",(int)ans.size());
    for(auto x:ans)printf("%d ",x);puts("");
    return 0;
}