Elbow | 프로그래밍의 벗 PivotOJ
PivotOJ

Elbow

시간 제한: 1000ms메모리 제한: 128MB출처: CHC 2002 Regional Competition - SeniorsBOJ 3257

문제

Mirko and Slavko are playing very interesting game. 

Each of them imagines one word, then they seat on the same computer and hitting each other with elbows typing their words on the keyboard. 

After that, they look at the screen and they see that their words are so mixed that they cannot find which letter belongs to one and which to another of them. 

Write the program that will decide for each letter from the screen if it belongs to Mirko's or Slavko's word. 

Note: solution does not to be unique.

입력

In first and second line of input file there are Mirko's and Slavko's word. Each word consists only from lowercase letters from English alphabet (a-z), and number of letters in each word will be less or equal than 150. 

In third row there is word from the screen. 

There will always be solution from the input data. 

출력

In first and only line of output file you should for each letter from the third word write down number '1' or number '2', so if we read letters from the third word on the positions denoted by number '1' we get first word, and if we read letters from the third word on the positions denoted by number '2' we get second word. 

예제

예제 1

입력
weissblume
exupery
weeisxsbulupmerey
출력
11211211211212212

예제 2

입력
novine
vesna
novesvinena
출력
11222111122

예제 3

입력
tata
mama
mtatamaa
출력
21112212

예제 4

입력
hsin
sinh
hsinhsin
출력
12222111
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.