Redaksiya

Let's consider the structure $map<int,int>m$, where $m[x]$ contains the number of villages with the name $x$. We'll read the villages in Karabakh and build the map $m$. Then, for each village $x$, we'll print the number of times $m[x]$ occurs.

Algorithm realization

Declare the data structure $m$.

map<int, int> m;

Read the input data. Store the villages of Karabakh in the map $m$.

scanf("%d %d", &n, &q);
for (i = 0; i < n; i++)
{
  scanf("%d", &x);
  m[x]++;
}

Process $q$ queries. For each village $x$, print the number of times $m[x]$ occurs.

for (i = 0; i < q; i++)
{
  scanf("%d", &x);
  printf("%d\n", m[x]);
}

Python realization

Read the input data.

n, q = map(int, input().split())
lst = list(map(int, input().split()))

Declare the vocabulary $m$.

m = {}

Store the information about the villages of Karabakh in the vocabulary $m$.

for x in lst:
  if x in m:
    m[x] += 1
  else:
    m[x] = 1

Process $q$ queries. For each village $x$, print the number of times $m[x]$ occurs. If the village $x$ is not found in the vocabulary, print $0$.

for _ in range(q):
  x = int(input())
  print(m.get(x, 0))