#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};    // 右，下，左，上
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class Fraction {
public:
    long long numerator;
    long long denominator;

public:
    Fraction() : numerator(1), denominator(1) {
    }

    Fraction(long long n, long long d) : numerator(n), denominator(d) {
        assert(d != 0);
    }

    Fraction operator+(const Fraction &o) {
        auto n = numerator * o.denominator + o.numerator * denominator;
        auto d = denominator * o.denominator;
//        auto c = gcd(n, d);
//        return Fraction(n / c, d / c);
        return Fraction(n, d);
    }

    Fraction operator-(const Fraction &o) {
        auto n = numerator * o.denominator - o.numerator * denominator;
        auto d = denominator * o.denominator;
        auto c = gcd(n, d);
        return Fraction(n / c, d / c);
    }

    Fraction operator*(const Fraction &o) {
        auto n = numerator * o.numerator;
        auto d = denominator * o.denominator;
        auto c = gcd(n, d);
        return Fraction(n / c, d / c);
    }

    Fraction operator/(const Fraction &o) {
        auto n = numerator * o.denominator;
        auto d = denominator * o.numerator;
        auto c = gcd(n, d);
        return Fraction(n / c, d / c);
    }

    bool operator==(const Fraction &o) {
        return this->numerator * o.denominator == o.numerator * this->denominator;
    }

    bool operator==(const int n) {
        return this->numerator == n * this->denominator;
    }

    bool operator==(const long long n) {
        return this->numerator == n * this->denominator;
    }

    bool operator>(const Fraction &o) {
        return this->numerator * o.denominator > o.numerator * this->denominator;
    }

    bool operator>(const int n) {
        return this->numerator > n * this->denominator;
    }

    bool operator>(const long long n) {
        return this->numerator > n * this->denominator;
    }

    bool operator<(const Fraction &o) {
        return this->numerator * o.denominator < o.numerator * this->denominator;
    }

    bool operator<(const int n) {
        return this->numerator < n * this->denominator;
    }

    bool operator<(const long long n) {
        return this->numerator < n * this->denominator;
    }

    void show() {
        std::cout << this->numerator << "/" << this->denominator << std::endl;
    }

private:
    long long gcd(const long long a, const long long b) {
        if (b == 0) { return a; }
        return gcd(b, a % b);
    }
};



int dfs(Fraction now, LL s, LL product, Fraction target, LL A, LL N) {
    if (N == 0) {
        return 0;
    }

    LL ans = 0;
    FOR(a, s, A + 10) {
        if (product * a <= A) {
            auto x = now + Fraction(1, a);
            if (target > x) {
                ans += dfs(x, a, product * a, target, A, N - 1);
            }
            else if (target == x) {
                ans++;
            }
        }
        else {
            break;
        }
    }
    return ans;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while (true) {
        LL P, Q, A, N;
        cin >> P >> Q >> A >> N;

        if (P == 0 and Q == 0 and A == 0 and N == 0) {
            return 0;
        }

        Fraction target(P, Q);
        LL ans = 0;
        FOR(a, 1, A + 10) {
            auto c = Fraction(1, a);
            if (target > c) {
                ans += dfs(c, a, a, target, A, N - 1);
            }
            else if (target == c) {
                ans++;
            }
        }
        print(ans);
    }

    return 0;
}




Measured memory_bytes: 3116