#include <iostream>

using namespace std;

int v[10];
int sol[20][20];
int q[20];

int main()
{
    int n, c1, c2;
    int sol_nr = 0;
    while (1)
    {
        ++sol_nr;
        cin >> n >> c1 >> c2;
        if (n == 0 && c1 == 0 && c2 == 0)
            break;
        int k = 0;
        while (n)
        {
            v[++k] = n%10;
            n /= 10;
        }
        bool zero = false;
        while (k > 0)
        {
            int x;
            if (v[k] == c1)
                x = c2;
            else
                x = v[k];
            if (x == 0 && zero)
                sol[sol_nr][++q[sol_nr]] = 0;
            else
                if (x != 0)
                {
                    sol[sol_nr][++q[sol_nr]] = x;
                    zero = true;
                }
            --k;
        }
        if (zero == false)
            sol[sol_nr][++q[sol_nr]] = 0;
    }

    for (int j = 1; j <= sol_nr; ++j)
    {
        for (int i = 1; i <= q[j]; ++i)
            cout << sol[j][i];
        cout << endl;
    }

    return 0;
}