C++ :

#include <bits/stdc++.h>
using namespace std;

int a[210],n,m,x; 
int main(){
    cin>>n>>m;
    for(int i = 1;i <= m;i++){
    	cin>>x;
    	a[x]++;
	}
	
	int ma = 1;
	for(int i = 1;i <= n;i++){
		if(a[i] > a[ma]) ma = i;
	}
	cout<<ma;
    return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
        int num2 = scanner.nextInt();
        int[] a = new int[num2];
        int[] b = new int[1000];
        int[] count = new int[10000];
        double avg;
        int x = 0;
        long s = 0;
        for (int i = 0; i < num2; i++) {
            a[i] = scanner.nextInt();
        }
        for(int i = 0;i < num2;i++){
                count[a[i]]++;
        }
        int max = MAX(count);
        for (int i = 0; i < 10000; i++) {
            if(count[i] == max){
                System.out.println(i);
                break;
            }
        }

    }

    public static boolean judge(int i,int j){
        int a,s = 0;
        while(i != 0){
            a = i % 10;
            s = s + a;
            i /= 10;
        }
        if(s == j)return true;
        else return false;
    }

    public static void paiXux(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }public static void paiXu(int[] a,int length){
        int temp;
        for(int i = 0;i < length - 1;i++){
            for(int k = 0;k < length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXud(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] < a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
    public static int sum(int a){
        int x,s = 0;
        while(a != 0){
            x = a % 10;
            s = s + x;
            a /= 10;
        }
        return s;
    }
    public static boolean isPrime(int a){
        if(a <= 1)return false;
        else
        for(int i = 2;i <= Math.sqrt(a);i++){
            if(a % i == 0)return false;
        }return true;
    }

    public static int qiuYu(int i){
        int a;
        a = i % 10;
        return a;
    }
}

Python :

sr=input().split()
m=int(sr[0])
n=int(sr[1])
a=input().split()
a=list(map(int,a))
a=sorted(a)
b=[]
for i in range(n):
    if (a[i] not in b):
        b.append(a[i])
da=a.count(b[0])
k=0
for i in range(len(b)):
    if(a.count(b[i])>da):
        da=a.count(b[i])
        k=i
print(b[k])