#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <bitset>

#define ll long long
#define maxn 1000007

using namespace std;

__int128 K , q , D , M , x , ans , N , a[maxn] , f[maxn]; vector< __int128 >v[maxn];

bool F[100][1000];

void dfs( ll pos , __int128 k , __int128 now )
{
	if( ans ) return;
	/*
	if( K <= 3 ) {
		int p = now / k + M;
		if( F[pos][p] ) return; else F[pos][p] = 1;
	}*/
	if( now == x && pos != 0 ) {
		for( int i = pos - 1 ; i >= 0 ; --i ) cout << (ll)f[i] << " ";
		cout << "\n"; ans = 1; return;
	}else if( k > N || k < -N ) return;
	__int128 tmp = ( ( ( x - now ) / k )% K + K ) % K;
	for( int i = 0 ; i < v[tmp].size() ; ++i ) {
		f[pos] = v[tmp][i];
		dfs( pos + 1 , k * K , now + k * v[tmp][i] );	
	}
}

int main()
{
	ios :: sync_with_stdio( false );
	cin.tie( 0 );
	ll s1 , s2 , s3 , s4; cin >> s1 >> s2 >> s3 >> s4;
	K = s1; q = s2; D = s3; M = s4; N = 1000000000000000000 * K * 1000;
	for( int i = 1 ; i <= D ; ++i ) {
		cin >> s1; a[i] = s1;
		v[( s1 % K + K ) % K].push_back( s1 );
	}
	while( q -- ) {
		cin >> s1; x = s1; ans = 0;
		dfs( 0 , 1 , 0 );
		for( int i = 0 ; i < 100 ; ++i ) for( int j = 0 ; j < 1000 ; ++j ) F[i][j] = 0; 
		if( !ans ) cout << "IMPOSSIBLE\n";
	}
	return 0;
 }