Ultimate Dragon

#include <stdio.h>

void merge(int arr[], int l, int m, int r){
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;
    int L[n1], R[n2];
    for (i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2){
        if (L[i] <= R[j]){
            arr[k] = L[i];
            i++;
        }else{
            arr[k] = R[j];
            j++;
        }
        k++;
    }
    while (i < n1){
        arr[k] = L[i];
        i++;
        k++;
    }
    while (j < n2){
        arr[k] = R[j];
        j++;
        k++;
    }
}
void mergeSort(int arr[], int l, int r){
    if (l < r){
        int m = l+(r-l)/2;
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);
        merge(arr, l, m, r);
    }
}

int count(int arr[], int n, int key){
    int left = 0, right = n;
    int mid;
    while (left < right){
        mid = left + (right-left)/2;

        if (arr[mid] == key){
            while (arr[mid+1] == key && mid+1<n)
                 mid++;
            break;
        }
        else if (arr[mid] > key)
            right = mid;
        else
            left = mid + 1;
    }
    while (arr[mid] > key)
        mid--;
    return mid + 1;
}

int main(){
    int size, queries, temp;
    scanf("%d %d", &size, &queries);
    int data[size];
    for(int i=0;i<size;i++){
        scanf("%d", &data[i]);
    }
    mergeSort(data, 0, size-1);
    while(queries--){
        scanf("%d", &temp);
        printf("%d\n", count(data, size, temp));
    }
    return 0;
}