Problem:
Max Score: 250 Points

Problem Statement

Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.

But he couldn't see some parts of the list. Invisible part is denoted ?.

Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.

Note: If there are pair of people with same handle name, either one may come first.

Input

The input is given from standard input in the following format.

N
S_1
S_2
:
S_N
T

Output

Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.

Put a line break in the end.

Constraints

1 ≤ N ≤ 10000

1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)

S_i consists from lower-case alphabet and ?.

T consists from lower-case alphabet.

Scoring

Subtask 1 [ 130 points ]

There are no ?'s.

Subtask 2 [ 120 points ]

There are no additional constraints.

Sample Input 1

2
tourist
petr
e

Sample Output 1

1

There are no invisible part, so there are only one possibility.
The sorted handle names are e, petr, tourist, so e comes first.

Sample Input 2

2
?o?r?s?
?et?
e

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Control.Monad
f c = map (\x -> if x == '?' then c else x)
g t s
  | x /= y || x == EQ || y == EQ = (0,1)
  | x == LT = (0,0)
  | x == GT = (1,0)
  where
    x = t `compare` f 'a' s
    y = t `compare` f 'z' s
h (a,b) (c,d) = (a+c,b+d)
main = do
  n <- readLn
  ss <- replicateM n getLine
  t <- getLine
  let (x,y) = foldl1 h $ map (g t) ss
  putStrLn $ unwords $ map show [x+1..x+y+1]