import
java.io.*;
import
java.util.*;
import
java.util.HashMap;
class
GFG {
static
void
findMaxEleCanPick(Integer arr[],Integer queries[],Integer n,Integer m)
{
HashMap<Integer, Integer> mp =
new
HashMap<>();
for
(
int
i=
0
;i<n;i++)
{
if
(mp.containsKey(arr[i]))
{
mp.put(arr[i],mp.get(arr[i]+
1
));
}
else
mp.put(arr[i],
1
);
}
int
Cum_freq[] =
new
int
[n];
int
x=
0
;
for
(Map.Entry<Integer, Integer> i : mp.entrySet())
Cum_freq[x++]=i.getValue();
Arrays.sort(arr, Collections.reverseOrder());
for
(Integer i=
1
;i<n;i++)
Cum_freq[i]+=Cum_freq[i-
1
];
for
(Integer k=
0
;k<m;k++)
{
if
(queries[k]>=m)
System.out.println(n+
" "
);
else
System.out.println(queries[k]-
1
);
}
}
public
static
void
main(String[] args)
{
Integer arr[]={
22
,
35
,
22
,
22
,
35
};
Integer queries[]={
4
,
5
,
1
};
findMaxEleCanPick(arr,queries,
5
,
3
);
}
}