#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000007

void solve() {

    ll A, B, C, D;
    cin >> A >> B >> C >> D;
    if(D%gcd(A,B) != 0) {
        cout << "No solution.\n";
        return;
    }

    ll t = 0;
    while(t*A < D) t++;
    while((t*A-D)%B != 0) t++;
    ll b = (t*A - D)/B;
    ll L = lcm(A,B);
    while(t*A - D < C) {
        t += L/A;
        b += L/B;
    }

    cout << "We need " << t << " truck" << (t != 1 ? "s" : "") << " and " << b << " boat" << (b != 1 ? "s" : "") << ".\n";

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}