64分，求调

#include<stdio.h>
int n, m,mid;
int a[1000005];
int b[1000005];
int ss(int x,int begin, int end)
{
	if (begin > end)
	{
		return -1;
	}
	mid = (begin + end) / 2;
	if (a[mid] < x)
	{
		return ss(x, mid + 1, end);
	}
	else if (a[mid] > x)
	{
		return ss(x, begin, mid - 1);
	}
	else
	{
		int k = mid;
		while (a[k] == a[mid])
		{
			k--;
		}
		return (k + 1);
	}
}
int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
	}
	for (int i = 1; i <= m; i++)
	{
		scanf("%d", &b[i]);
	}
	for (int i = 1; i <= m; i++)
	{
		int ans=ss(b[i], 1, n);
		printf("%d ", ans);
	}

	
	return 0;
}