URI Online Judge | 2946
# Dabriel and the Divisibility

**Timelimit: 1**

By Gabriel Duarte, UFF Brazil

Dabriel loves to play with numbers and this time has a very interesting game. It has a binary number **N** and a list with **M** numbers and you want to know for which numbers **M _{i}** from that list

This task is very easy for him, so you will not waste time doing this, can you help him?

The first line contains a number in binary **N** (1 ≤ |**N**| ≤ 10^{5}). In the second line contains an integer **M** (1 ≤ **M** ≤ 10), which represents how many numbers one wants to know the divisibility. In the next **M** lines, it will have an integer **M _{i}** (1 ≤

Print out all the numbers that divide **N** from the list given by Dabriel (as he is a little inattentive there may be duplicates in his list, so print out all), separated by a space, ordered in ascending order. If no number exists, print: "Nenhum", without quotation marks.

Input Samples | Output Samples |

1011 |
Nenhum |

1100 |
1 2 4 6 |