Submit solution

Points:
10

Time limit:
1.0s

Memory limit:
16M

Problem types

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### Canadian Computing Competition: 2001 Stage 1, Senior #5

Let and be two sequences of non-empty strings: . Let be a positive integer. Does there exist a sequence of integers such that and ? For example, if and , then the required sequence of integers is giving .

#### Input Specification

The first two lines of input will contain and respectively, and . The next lines contain in order the elements of followed by the elements of . Each string is at most 20 characters.

#### Output Specification

If a solution exists, print on a line by itself, followed by the integer sequence in order, one element per line. Otherwise, print a single line containing `No solution.`

#### Sample Input 1

```
7
3
a
abaaa
ab
aaa
ab
b
```

#### Sample Output 1

```
4
2
1
1
3
```

#### Sample Input 2

```
10
3
abc
def
ghi
jkl
mno
pqr
```

#### Sample Output 2

`No solution.`

## Comments