【G ECJTU_ACM 11级队员2012年暑假训练赛（2）】

G - G

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Igor K. always used to trust his favorite Kashpirovsky Antivirus. That is why he didn't hesitate to download the link one of his groupmates sent him via QIP Infinium. The link was said to contain "some real funny stuff about swine influenza". The antivirus had no objections and Igor K. run the flash application he had downloaded. Immediately his QIP Infinium said: "invalid login/password".

Igor K. entered the ISQ from his additional account and looked at the info of his main one. His name and surname changed to "H1N1" and "Infected" correspondingly, and the "Additional Information" field contained a strange-looking binary code 80characters in length, consisting of zeroes and ones. "I've been hacked" — thought Igor K. and run the Internet Exploiter browser to quickly type his favourite search engine's address.

Soon he learned that it really was a virus that changed ISQ users' passwords. Fortunately, he soon found out that the binary code was actually the encrypted password where each group of 10 characters stood for one decimal digit. Accordingly, the original password consisted of 8 decimal digits.

Help Igor K. restore his ISQ account by the encrypted password and encryption specification.

Input

The input data contains 11 lines. The first line represents the binary code 80 characters in length. That is the code written in Igor K.'s ISQ account's info. Next 10 lines contain pairwise distinct binary codes 10 characters in length, corresponding to numbers 0, 1, ..., 9.

Output

Print one line containing 8 characters — The password to Igor K.'s ISQ account. It is guaranteed that the solution exists.

Sample Input

Input

01001100100101100000010110001001011001000101100110010110100001011010100101101100
0100110000
0100110010
0101100000
0101100010
0101100100
0101100110
0101101000
0101101010
0101101100
0101101110

Output

12345678

Input

00001000011100010110010011111101111010100111101010111000101001001111111110001010
1100011011
1100010110
0011101111
0100111111
0001010100
1110001010
0111101010
0000100001
1110011011
0010011010

Output

71366535

// Project name : G
// File name    : main.cpp
// Author       : Izumu
// Date & Time  : Tue Jul 10 14:15:29 2012


#include <iostream>
#include <stdio.h>
#include <string>
#include <cmath>
using namespace std;

int main()
{
    string s;
    while (cin >> s)
    {
        string num[10];
        for (int i = 0; i < 10; i++)
        {
            cin >> num[i];
        }

        char str_tmp[20];
        for (int time = 0; time < 8; time++)
        {
            // init for str_tmp
            for (int i = 0; i < 20; i++)
            {
                str_tmp[i] = '\0';
            }

            for (int i = 0; i < 10; i++)
            {
                str_tmp[i] = s[time * 10 + i];
            }

            string s_tmp = str_tmp;

            bool found = false;
            for (int i = 0; !found && i < 10; i++)
            {
                if (s_tmp == num[i])
                {
                    cout << i;
                    found = true;
                }
            }
        }
        cout << endl;
    }
    return 0;
}

// end 
// ism