#include<iostream>
#include<algorithm>

#define lint int64_t

#define gcd __gcd

using
		namespace
					std;

lint a,b,c,d;

pair<lint,lint> p;

pair<lint,lint> exgcd(lint a,lint b,lint c){
	
	if(b==0) return pair<lint,lint>(c/a,0);
	p=exgcd(b,a%b,c);
	return {p.second,p.first-a/b*p.second};
}

signed main(){
	
	cin>>a>>b>>c>>d;
	
	if(d%gcd(a,b)){
		
		printf("No solution.\n");
		return EOF+1;
	}
	
	pair<lint,lint> kotae=exgcd(a,-b,d);
	
	lint k=kotae.first/b;
	kotae.first-=k*b;
	kotae.second+=k*a;
	
	kotae.first+=200*b;
	kotae.second+=200*a;
	
	lint g=gcd(a,b);
	
	lint da=a/g,db=b/g;
	
	while((kotae.second-da)*b>=c){
		
		kotae.first-=db;
		kotae.second-=da;
	}
	
	printf("We need %lld truck",kotae.first);
	if(kotae.first!=1) putchar('s');
	printf(" and %lld boat",kotae.second);
	if(kotae.second!=1) putchar('s');
	printf(".\n");
	
end:
	return EOF+1;
}
/*
31 13 50 28
100 20 30 10
1 1 1 100
*/