#include <iostream>

using namespace std;

int qw[20][100],n,c1,c2,glb;

int think(int n,int a,int b)
{
    int i=0;

    glb++;

    while(n!=0)
    {
        i++;
        qw[glb][i]=n%10;
        if(n%10==a)
           qw[glb][i]=b;
        n/=10;
    }
    qw[glb][0]=i;
    while(qw[glb][qw[glb][0]]==0 && qw[glb][0]>1)
        qw[glb][0]--;
    return 0;
}



int main()
{
    while(true)
    {
        cin>>n>>c1>>c2;
        if(n==c1 && c1==c2 && n==0)
            break;
        think(n,c1,c2);
    }

    for(int i=1;i<=glb;i++)
    {
        for(int j=qw[i][0];j>=1;j--)
            cout<<qw[i][j];

        cout<<'\n';
    }
     return 0;
}