#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define INF  INT_MAX
#define LINF LLONG_MAX
#define F first
#define S second
#define ld long double
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector<pii>
#define rep(i,n) for(i=0;i<n;i++)
#define repr(i,n) for(i=n-1;i>=0;i--)
#define o4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl;
#define initial(arr,val) memset(arr,val,sizeof(arr))
#define value(x) cout << #x << " is " << x << endl;
#define int long long
#define all(v) v.begin(), v.end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int N=1e5+2;
long double dp[N+1][10];
pair<int,int> last[N+1][10];
void solve(){
  int n,d;
  cin>>n>>d;
  int arr[n+1];
  for(int i=1;i<=n;i++){
    cin>>arr[i];
    for(int j=0;j<10;j++){
      dp[i][j]=-1.0;
      last[i][j]={0,0};      
    }
  }
  for(int j=0;j<10;j++){
      dp[0][j]=-1.0;  
      last[0][j]={0,0};    
    }
  for(int i=1;i<=n;i++){
    for(int j=0;j<10;j++){
      dp[i][j]=dp[i-1][j];
      last[i][j]=last[i-1][j];      
    }
    int dig=arr[i]%10;
    for(int j=0;j<10;j++){
      if(dp[i-1][j]<0)
        continue;
      int newdig=(j*dig)%10;
      if(dp[i-1][j]+log(arr[i])>dp[i][newdig]){
        auto u = last[i-1][j];
        last[i][newdig]={j,i};
      }
      dp[i][newdig]=max(dp[i][newdig],dp[i-1][j]+log(arr[i]));
    }
    if(dp[i][dig]<log(arr[i])){
      last[i][dig]={-1,i};
      dp[i][dig]=log(arr[i]);
    }
    // dp[i][dig]=max(dp[i][dig],log(arr[i]));
  }
  // for(int i=1;i<=n;i++){
  //   for(int j=0;j<10;j++)
  //     cout<<dp[i][j]<<" ";
  //   cout<<endl;
  // }
  // for(int i=1;i<=n;i++){
  //   for(int j=0;j<10;j++)
  //     cout<<last[i][j]<<" ";
  //   cout<<endl;
  // }
  if(dp[n][d]==-1){
    cout<<"-1"<<endl;
  }
  else{
    vector<int> ans;
     // cout<<dp[n][d]<<endl;
    int x=dp[n][d];
    int ind=n;
    while(ind>0){
      int ind1=last[ind][d].S;
      if(ind1<=0)
        break;
      // cout<<ind<<" "<<arr[ind]<<endl;
      ans.pb(arr[ind1]);
      d=last[ind][d].F;
      if(d==-1)
        break;
      ind=ind1-1;
    }
    cout<<ans.size()<<endl;
    for(auto u : ans)
      cout<<u<<" ";

    // cout<<endl<<x<<endl;
  
  }

  
}

int32_t main() { 
ios_base::sync_with_stdio(false); 
cin.tie(0); 
cout.tie(0);
int tc=1;
// cin>>tc;
for(int j=1 ;j<=tc;j++){
    // cout<<"Case #"<<j<<": ";
 solve();
 

}
return 0;
}
// 5 4
// 4 11 8 1 13