Chief Election | Geek Goddess

In the city of La La Land, the sports chief is to be elected. Mr. Jani, who himself is a great athlete, is standing for the position. It looks like a cake for him but it is not so. Throughout his career, he has been involved in many controversies and because of this the people are divided. To challenge him, Ms. Ramya has also submitted her application. She is a fierce lady with a great track record but is considered too strict with her discipline norms.

There are multiple departments in the sports authority. On the election day, each department is provided with an integer. It also means multiple persons from the same department have the same integer.

Election Rules:

  1. Different persons belonging to the same department, have the same integer.

  2. Multiple votes with the same integer will be considered as a single unique vote.

  3. To win, Mr. Jani should have atleast M unique votes. If not, then, Ms. Ramya will be elected as the Chief Officer.

Note: If there are 3 people belonging to one department having an integer 5 and they all vote, then it will be considered as a single unique vote.

Now, on election day, N people have casted their vote. The votes are stored and are presented to you. The authority is asking you to declare the winner as per the rules. Declare the election results and name the new Chief Officer.


Number of people who casted their vote, N = 10

Number of minimum votes required by Mr. Jani, M = 6

The votes casted are given below,

There are only 5 unique votes, 1, 2, 3, 4 and 5. Mr. Jani required minimum 6 unique votes to win so Ms. Ramya is the winner.

Input Format

The first line of input consists of number of test cases, T

The first line of each test case consists of two space-separated integers, N and M.

The second line of each test case consists of N space-separated integers.



1<= N <=10000

0<= M <=N

1<= Ni <=10000

Output Format

For each test case, print JANI if Mr. Jani wins otherwise print RAMYA. The output is case sensitive.

Sample TestCase 1
10 6
1 2 1 4 1 1 3 1 1 5
6 3
1 2 3 4 2 1

Test Case 1: As explained in the example.

Test Case 2: Minimum unique votes required by Mr. Jani is 3. The number of unique votes casted is 4 (1, 2 3 and 4). The winner is Mr. Jani.

Java Solution
import java.util.*;

public class CandidateCode {
public static void main(String args[]) throws Exception {

Scanner sc = new Scanner(;
int t = sc.nextInt();
while (t > 0) {
int numberOfPeoples = sc.nextInt();
int requiredMinimumVotes = sc.nextInt();
Vote<Integer> vote = new Vote<>();
while (numberOfPeoples > 0) {
int v = sc.nextInt();
if (!vote.contains(v)) {
System.out.println(vote.size() >= requiredMinimumVotes ? "JANI" : "RAMYA");

class Vote<Integer> extends HashSet<Integer> {

public boolean contains(Object o) {
return super.contains(o);

public boolean add(Integer integer) {
return super.add(integer);

Python Solution

import sys
import os

T = int(input())
for i in range(T):
n, m = map(int, input().split())
votes = list(map(int, input().split()))
unique_votes = len(set(votes))
if unique_votes >= m: