Problem: Diana loves playing with numbers. She's got n cards with positive integer numbers a_i written on them. She spends her free time multiplying the numbers on the cards. She picks a non-empty subset of the cards and multiplies all the numbers a_i written on them.

Diana is happy when the product of the numbers ends with her favorite digit d. Now she is curious what cards she should pick so that the product of the numbers on them is the largest possible and the last decimal digit of the product is d. Please, help her.

Input

The first line contains the integers n and d (1≤ n≤ 10^5, 0≤ d≤ 9). The second line contains n integers a_i (1≤ a_i≤ 1000). 

Output

On the first line, print the number of chosen cards k (1≤ k≤ n). On the next line, print the numbers written on the chosen cards in any order. 

If it is impossible to choose a subset of cards with the product that ends with the digit d, print the single line with -1.

Examples

Input


6 4
4 11 8 2 1 13


Output


5
1 2 4 11 13 


Input


3 1
2 4 6


Output


-1


Input


5 7
1 3 1 5 3


Output


-1


Input


6 3
8 9 4 17 11 5


Output


3
9 11 17 


Input


5 6
2 2 2 2 2


Output


4
2 2 2 2 

Note

In the first example, 1 × 2 × 4 × 11 × 13 = 1144, which is the largest product that ends with the digit 4. The same set of cards without the number 1 is also a valid answer, as well as a set of 8, 11, and 13 with or without 1 that also has the product of 1144.

In the second example, all the numbers on the cards are even and their product cannot end with an odd digit 1.

In the third example, the only possible products are 1, 3, 5, 9, 15, and 45, none of which end with the digit 7.

In the fourth example, 9 × 11 × 17 = 1683, which ends with the digit 3. 

In the fifth example, 2 × 2 × 2 × 2 = 16, which ends with the digit 6.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
const int N = 100010;
const double INFD = 1e100;
int _w;

int n, d, a[N];

double f[N][10];
pii g[N][10];

void solve() {
	for( int i = 0; i < N; ++i )
		for( int j = 0; j < 10; ++j ) {
			f[i][j] = -INFD;
			g[i][j] = pii(-1, -1);
		}
	for( int i = 1; i <= n; ++i )
		f[i][a[i] % 10] = log( a[i] );
	for( int i = 1; i < n; ++i )
		for( int j = 0; j < 10; ++j ) {
			if( f[i][j] > f[i+1][j] ) {
				f[i+1][j] = f[i][j];
				g[i+1][j] = pii(0, j);
			}
			int x = a[i+1];
			int nj = j * x % 10;
			if( f[i][j] + log(x) > f[i+1][nj] ) {
				f[i+1][nj] = f[i][j] + log(x);
				g[i+1][nj] = pii(1, j);
			}
		}
	if( f[n][d] < -100 ) {
		puts("-1");
		return;
	}
	vector<int> ans;
	int i = n;
	int j = d;
	while( j != -1 ) {
		if( g[i][j].first )
			ans.push_back( a[i] );
		j = g[i][j].second;
		i--;
	}
	printf( "%d\n", (int)ans.size() );
	sort(ans.begin(), ans.end());
	for( int i = 0; i < (int)ans.size(); ++i ) {
		if( i ) putchar(' ');
		printf( "%d", ans[i] );
	}
	puts("");
}

int main() {
	_w = scanf( "%d%d", &n, &d );
	for( int i = 1; i <= n; ++i )
		_w = scanf( "%d", a+i );
	solve();
	return 0;
}