PAT 1010

#include <iostream>
using namespace std;
long long int toD(string str,long long int radix){
    long long int num=0;
    for(int i=0;i<str.length();i++){
        if(str[i]>='a'&&str[i]<='z'){
            num=num*radix+(str[i]-'a')+10;
        }
        else{
            num=num*radix+str[i]-'0';
        }
    }
    return num;
}
int maxNum(string str){
    int num=0;
    for(int i=0;i<str.length();i++){
        if(str[i]>='a'&&str[i]<='z'&&num<str[i]-'a'+10)num=str[i]-'a'+10;
        else if(str[i]>='0'&&str[i]<='9'&&num<str[i]-'0')num=str[i]-'0';
    }
    return num;
}
int compare(string str,long long radix,long long target){
    long long num=0;
    for(int i=0;i<str.length();i++){
        if(str[i]>='a'&&str[i]<='z')num=num*radix+str[i]-'a'+10;
        else num=num*radix+str[i]-'0';
        if(num>target)return 1;
    }
    if(num==target)return 0;
    else return -1;
}
long long int binarySearch(long long int b,long long int e,string str,long long target){
    while(b<=e){
        long long int mid = b+(e-b)/2;
        int temp=compare(str, mid, target);
        if(temp==0)return mid;
        else if(temp==1)e=mid-1;
        else if(temp==-1)b=mid+1;
    }
    return -1;
}
int main(){
    string num[2];
    long long int tag,radix,rec=2;
    long long int numT;
    cin>>num[0]>>num[1]>>tag>>radix;
    numT=toD(num[tag-1],radix);
    tag=!(tag-1);
    rec=maxNum(num[tag])+1;
    if(num[0]==num[1])rec=radix;
    else if(rec<numT)rec=binarySearch(rec, numT, num[tag], numT);
    else rec= (numT==toD(num[tag],rec))?rec:-1;
    if(rec==-1)cout<<"Impossible"<<endl;
    else cout<<rec<<endl;
}