view feedback


#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

typedef long long ll;

int gcd(int a, int b)
{
    while(b != 0)
    {
        a = a % b;
        swap(a, b);
    }
    return a;
}
int main() {
    ll a, b, c, d, N, n;

    cin >> a >> b >> c >> d >> N >> n;
    pair<ll, ll> p;
    vector<pair<ll, ll>> v;
    double m1, m2, m3;
    bool m = true;
    for(ll j = 1; j <= N && v.size() < n; j++)
    {
        for(ll i = (a * j) / b + 1; i <= min(N, (c * j + d - 1) / d - 1) && v.size() < n; i++)
        {
            if(1.0 * a * j < 1.0 * b * i && 1.0 * i * d < 1.0 * j * c && gcd(i, j) == 1 && v.size() < n)
            {
                v.push_back({i, j});
            }

        }
    }

    cout << v.size() << "\n";
    for(auto i : v)
    {
        cout << i.first << " " << i.second << "\n";
    }
    return 0;
}