PAT-B1062

#include<stdio.h>
#include<algorithm>
using namespace std;
int gcd(int a, int b){
	if(b==0) return a;
	else return gcd(b,a%b);
}
int main(){
int i, n1,m1, n2,m2, k, count=0;
double low=0, high=0;
scanf("%d/%d %d/%d %d",&n1,&m1,&n2,&m2,&k);
low=1.0*n1/m1;
high=1.0*n2/m2;
if(low>high)swap(low,high);
for(i=1;i<k;i++){
	if(double(1.0*i/k)>low&&double(1.0*i/k)<high&&gcd(i,k)==1){
	    if(count>0)printf(" ");
		printf("%d/%d",i,k);
		count++;
	}
}
return 0;
}