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 C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>

int main(){
	int n,i,j,fc=0,lc=0;
	char s[16384][32],sf[32],sl[32],t[i];
	scanf("%d",&n);
	for(i = 1;i <= n;i++){scanf("%s",s[i]);}
	scanf("%s",t);
	for(i = 1;i <= n;i++){
		for(j = 0;j < 32;j++){sf[j]=0;sl[j]=0;}
		for(j = 0;j < strlen(s[i]);j++){
			if(s[i][j] == '?'){sf[j]='a';sl[j]='z';}
			else{sf[j]=s[i][j];sl[j]=s[i][j];}
		}
		if(strcmp(t,sf) < 0){lc++;}
		if(strcmp(sl,t) < 0){fc++;}
	}
	for(i = fc+1;i <= n-lc+1;i++){if(i != fc+1){printf(" ");}printf("%d",i);}
	printf("\n");
	return 0;
}