#include<iostream>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<cstdio>

#include<vector>

#define ll long long

using namespace std;

const int maxn=233333;

ll T,a,b,c,k,ans,sol[maxn];

inline ll get(ll x){

	if(x<0) return -19260817;

	ll an=0;

	for(;x;an+=x%10,x/=10);

	return an;

}

inline ll ksm(ll x,ll y){

	ll an=1;

	for(;y;y>>=1,x=x*x) if(y&1) an=an*x;

	return an;

}

inline void solve(){

	ans=0,scanf("%lld%lld%lld%lld",&a,&b,&c,&k);

	for(int i=0;i<=81;i++){

		ll now=ksm(i,a)*b+c;

		if(get(now)==i&&now<=k) sol[++ans]=now;

	}

	if(!ans){

		puts("0");

		puts("-1");

		return;

	}

	printf("%lld\n",ans);

	sort(sol+1,sol+ans+1);

	for(int i=1;i<=ans;i++) printf("%lld ",sol[i]);

	puts("");

}

int main(){

	freopen("safe.in","r",stdin);

	freopen("safe.out","w",stdout);

	scanf("%lld",&T);

	while(T--) solve();

	return 0;

}