#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#define ENVIRONMENT_LINKED_ACL

#ifdef ENVIRONMENT_LINKED_ACL
#include <atcoder/convolution>
#include <atcoder/lazysegtree>
#include <atcoder/segtree.hpp>
#endif

//#define ENVIRONMENT_LINKED_BOOST

#ifdef ENVIRONMENT_LINKED_BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#endif

using namespace std;
using uint = unsigned int;
using ll   = long long;
using ull  = unsigned long long;
#define REP(i, a, b)    for (ll i = a; i < b; ++i)
#define REPREV(i, a, b) for (ll i = a; i > b; --i)

const int _ = []() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
    return 0;
}();

template <typename value_t>
void resize(value_t& v, const value_t& val) { v = val; }
template <typename vec_t, typename value_t, typename... arg_t>
void resize(std::vector<vec_t>& v, const value_t& val, int size, arg_t... arg) {
    v.resize(size);
    for (auto& c : v) resize(c, val, arg...);
}

template <typename A, typename B>
void chmin(A& a, const B& b) {
    a = min(a, static_cast<A>(b));
};
template <typename A, typename B>
void chmax(A& a, const B& b) {
    a = max(a, static_cast<A>(b));
};

int main() {
    int n, d;
    cin >> n >> d;
    vector<int> a(n);
    REP(i, 0, n) {
        cin >> a[i];
    }
    vector<array<pair<long double, pair<int, int>>, 10>> dp(n + 1);
    REP(i, 0, n + 1) {
        REP(j, 0, 10) {
            dp[i][j] = {-1, {-1, -1}};
        }
    }
    constexpr long double eps = 1e-10;
    dp[0][1].first            = 0;
    REP(i, 0, n) {
        REP(j, 0, 10) {
            if (dp[i][j].first + eps < 0) continue;
            if (dp[i + 1][j].first + eps < dp[i][j].first) dp[i + 1][j] = dp[i][j];

            int nj         = j * a[i] % 10;
            long double nv = dp[i][j].first + logl(a[i]);
            if (nv > dp[i + 1][nj].first + eps) dp[i + 1][nj] = {nv, {i, j}};
        }
    }
    if (dp[n][d].second.first < 0)
        cout << -1 << endl;
    else {
        int cnt = 0;
        vector<int> ans;
        pair<int, int> p = dp[n][d].second;
        while (p.first >= 0) {
            ++cnt;
            ans.push_back(a[p.first]);
            p = dp[p.first][p.second].second;
        }
        cout << cnt << endl;
        for (int x : ans) {
            cout << x << " ";
        }
        cout << endl;
    }
    return 0;
}