#include #include #include using namespace std; int main(void){ int cases; cin >> cases; int n,p; vector > v; vector blocks; vector valid_wall; while(cases--){ cin >> n >> p; v.clear(); v.resize(n); blocks.clear(); blocks.resize(101, 0); valid_wall.clear(); valid_wall.resize(n,true); for(int i=0;i> a >> d>> b >> d; if(b i) break; if(v[j].second < i) continue; if(reach_idx < v[j].second){ trg_idx = j; reach_idx = v[j].second; } } for(int j = v[trg_idx].first; j<= v[trg_idx].second;j++) blocks[j]--; valid_wall[trg_idx] = false; //v.erase(v.begin()+trg_idx,v.begin()+trg_idx +1); i--; } cout << ans << endl; } return 0; }