#include <iostream>
#include <algorithm>
#include <stdio.h>
#include "optimization.h"
#include <assert.h>

using namespace std;

int main() {
    int n, k, a, b;
    n = readInt();
    k = readInt();
    int Left[n];
    int Right[n];
    for (int i = 0; i < n; ++i) {
        a = readInt();
        b = readInt();
        Left[i] = min(a, b);
        Right[i] = max(a, b);
    }

    sort(Left, Left + n);
    sort(Right, Right + n);


    for (int i = 0, x, count = 0; i < k; ++i) {
        x = readInt();
        int left = 0, right = n - 1, middle;
        while (left <= right) {
            middle = (left + right) / 2;
            if (Left[middle] > x)
                right = middle - 1;
            else
                left = middle + 1;
        }
        count = right + 1;

        left = 0;
        right = n - 1;
        while (left <= right) {
            middle = (left + right) / 2;
            if (Right[middle] < x)
                left = middle + 1;
            else
                right = middle - 1;
        }
        count -= right + 1;
        writeInt(count);
        writeChar(' ');
    }