#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a >= b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n,m;cin >> n >> m; ll base=200; vector>> small(base); ll sz=1e5+10; vl dp(sz); pair que; rep(_,n){ ll l,r,x,y;cin >> l >> r >> x >> y; if(x=l&&k<=r)dp[k]++; } } } for(auto &p:small){ for(auto &[hoge,vs]:p){ sort(all(vs.first)); sort(all(vs.second)); } } //return 0; rep(_,m){ ll a;cin >> a; ll ans=dp[a]; for(ll k=1;k