Нахождение первого и последнего вхождения заданного числа в

#include <iostream>
#include <string>
#include <cmath>
using namespace std;

int main()
{
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);

	int n, k, c, l, r, m;
	scanf("%d", &n);
	int f = 0;
	int* mas = new int[n + 2];
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &mas[i]);
	}
	scanf("%d", &k);
	int b = n;
	for (int s = 0; s < k; s++)
	{
		scanf("%d", &c);
		int max;
		int min;

		l = 0;
		r = n - 1;

		while (l - r < 0)
		{
			m = (l + r + 1) / 2;
			if (mas[m] <= c)
			{
				l = m;
			}
			else
			{
				r = m - 1;
			}
		}
		if (mas[l] == c)
		{

			max = l+1;
			f++;
		}

		l = 0;
		r = n - 1;

		while (l - r < 0)
		{
			m = (l + r ) / 2;
		if (mas[m] < c)
			{
				l = m + 1;
			}
			else
			{
				r = m;
			}
		}
		if (mas[r] == c)
		{

			min = l + 1;

		}

		if (f == 0)
		{
			printf("Not found");
			printf("%s", "\n");
		}
		else
		{


			printf("%d", min);
			printf(" %d", max);
			printf("%s", "\n");
		}
		f = 0;
	}


}