#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define base 2333
const int mod=1e9+7;
const int maxn=4e2+10;
const int ub=1e6;
int powmod(int x,int y){int t; for(t=1;y;y>>=1,x=x*x) if(y&1) t=t*x; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int n,k,p,maxsum=0,maxc;
int ans[maxn],flag=0,tmp[maxn],idx2=0;
int cmp(){
for(int i=0;i<k;i++){
if(ans[i]>tmp[i]) return 0;
if(ans[i]<tmp[i]) return 1;
}
return 0;
}
void dfs(int left,int cnt,int cur,int ub){
///if(flag) return ;
///cout<<left<<" "<<maxc<<" "<<cnt<<" "<<cur<<endl;
if(cnt==0){
if(left==0&&cur>maxsum){
memcpy(ans,tmp,sizeof(ans));
flag=idx2;
maxsum=cur;
}
return ;
}
if(left<cnt) return ;
for(int i=ub;i>=1;i--){
int tmpp=pow(i,p);
tmp[idx2++]=i;
dfs(left-tmpp,cnt-1,cur+i,i);
idx2--;
}
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>k>>p;
maxc=1;
while(pow(maxc,p)<=n) maxc++;
maxc--;
dfs(n,k,0,maxc);
if(flag){
cout<<n<<" = ";
rep(i,0,flag){
cout<<ans[i]<<"^"<<p;
if(i==flag-1){
cout<<"\n";
}else{
cout<<" + ";
}
}
}else{
cout<<"Impossible\n";
}
return 0;
}