# include <bits/stdc++.h>
using namespace std ;
priority_queue <int> wrm ; 
int main ( )
{
	int n , m , q , u , v , t , sum = 0 ;
	cin >> n >> m >> q >> u >> v >> t ;
	double p =  ( u * 1.0 ) / v ;
	for ( int i = 1 ; i <= n ; ++ i )
	{
		int tmp ;
		cin >> tmp ;
		wrm . push ( tmp ) ;
	}
	for ( int i = 1 ; i <= m ; i ++ )
	{
		int bg = wrm . top ( ) + sum ;
		wrm . pop ( ) ;
		if ( ! ( i % t ) )
		{
			cout << bg << ' ' ;
		}
		int ct = floor ( q * ( bg * 1.0 ) ) ;
		wrm . push ( ct - sum - q ) ;
		wrm . push ( bg - ct - sum - q ) ;
		sum += q ;
	}
	cout << endl ;
	for ( int i = 1 ; i <= n + m ; ++ i )
	{
		if ( ! ( i % t ) )
		{
			cout << wrm . top ( ) + sum << ' ' ;
		}
		wrm . pop ( ) ;
	}
	cout << endl ;
	return 0 ;
}