//

 //by coolxxx

 //#include<bits/stdc++.h>

 #include<iostream>

 #include<algorithm>

 #include<string>

 #include<iomanip>

 #include<map>

 #include<memory.h>

 #include<time.h>

 #include<stdio.h>

 #include<stdlib.h>

 #include<string.h>

 //#include<stdbool.h>

 #include<math.h>

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))

 #define mem(a,b) memset(a,b,sizeof(a))

 #define eps (1e-8)

 #define J 10

 #define MAX 0x7f7f7f7f

 #define PI 3.14159265358979323

 #define N 224

 using namespace std;

 typedef long long LL;

 int cas,cass;

 int n,m,lll,ans;

 double mi(double x,int y)

 {

     double sum=;

     while(y)

     {

         if(y&)sum=sum*x;

         x=x*x;

         y>>=;

     }

     return sum;

 }

 int main()

 {

     #ifndef ONLINE_JUDGE

 //    freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j,k,y,dk,dk1,dk2;

     double r1,r2,y1,y2;

 //    for(scanf("%d",&cas);cas;cas--)

 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)

     while(~scanf("%d",&n))

 //    while(~scanf("%d",&n))

     {

         scanf("%d",&m);

         scanf("%lf%lf",&r1,&r2);

         scanf("%d",&y);y=y*;

         dk=n*/;r1/=;r2/=;

         dk2=min(dk,m);dk1=dk-dk2;

         n-=dk;

         y1=mi(+r1,y);

         y1=*dk1*r1*y1/(y1-);

         //if(int(y1*10)%10>=5)y1+=1;

         y2=mi(+r2,y);

         y2=*dk2*r2*y2/(y2-);

         //if(int(y2*10)%10>=5)y2+=1;

         printf("%d %d\n",n,int(y1+y2+0.5000001));

     }

     return ;

 }

 /*

 //

 //

 */