#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

using namespace std;

int i,j,n,m,q,c;

struct node

{

    int a,b;

}p[];

bool cmp(node a,node b)

{

    if(a.a!=b.a) return a.a>b.a;

    return a.b>b.b;

}

int sum[];

priority_queue<int, vector<int>, greater<int> > que;

int main()

{

    while (~scanf("%d%d%d",&n,&m,&q))

     {

        while (!que.empty())que.pop();

        for (i=;i<m;i++)scanf("%d%d",&p[i].a,&p[i].b);

        sort(p,p+m,cmp);

        sum[]=;

        int a1,a2;

        for (i=n,j=;i>=;i--)

         {

            for (;j<m;j++)

             {

                if (i<=p[j].a) que.push(p[j].b);

                else  break;

             }

            if ((int)que.size()<)

             {

                sum[i]=;

                continue;

             }

            a1=que.top();

            que.pop();

            a2=que.top();

            que.pop();

            que.push(a1);

            que.push(a2);

            if(i-a2<) sum[i]=;

            else sum[i]=i-a2;

         }

        while (q--)

         {

            scanf("%d",&c);

            printf("%d\n",sum[c]);

         }

     }

    return ;

}