import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    String[][] S = new String[N + 1][2];
    for (int i = 0; i < N; i ++) {
      S[i][0] = sc.next();
    }
    S[N][0] = sc.next();
    S[N][1] = "x";
    
    
    sort(S, 'z', -1);
    int min = search(S);
    
    sort(S, 'a', 1);
    int max = search(S);
    
    StringBuilder sb = new StringBuilder();
    for (int i = min; i <= max; i ++) {
      sb.append(i + 1);
      sb.append(" ");
    }
    System.out.println(sb.substring(0, sb.length() - 1));
  }
  
  private static int search(String[][] S) {
    for (int i = 0; i < S.length; i ++) {
      if (S[i][1] != null) { 
        return i;
      }
    }
    return -1;
  }
  
  private static void sort(String[][] S, char alt, int d) {
    Arrays.sort(S, (a, b) -> {
      int len = Math.min(a[0].length(), b[0].length());
      for (int i = 0; i < len; i ++) {
        int c1 = a[0].charAt(i) == '?' ? alt : a[0].charAt(i);
        int c2 = b[0].charAt(i) == '?' ? alt : b[0].charAt(i);
        if (c1 != c2)
          return c1 - c2;
      }
      if (a[0].length() != b[0].length()) {
        return a[0].length() - b[0].length();
      } else if (a[1] != null) {
        return d;
      } else if (b[1] != null) {
        return -d;
      } else { 
        return 0;
      }
    });
  }
}




class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}

Measured memory_bytes: 26580