#include <stdio.h> #include <string.h> #include <algorithm> int T, D, N, book[32]; struct clockin { int d, h; }a[205]; bool cmp(clockin e, clockin f) { return e.d == f.d ? e.h < f.h : e.d < f.d; } int main() { scanf("%d", &T); while(T--) { int i, h1, h2, sum = 0; for(i = 1; i <= 100; i++) a[i].d = a[i].h = 0; memset(book, 0, sizeof(book)); scanf("%d %d", &D, &N); for(i = 1; i <= N; i++) scanf("%d %d", &a[i].d, &a[i].h); std:: sort(a+1, a+1+N, cmp); for(i = 1; i <= N; i++) for(i = 1; i <= N; i++) { if(!book[a[i].d]) h1 = a[i].h, book[a[i].d]++; if(a[i].d != a[i+1].d) { h2 = a[i].h; //printf("Day:%d h2-h1:%d", a[i].d, h2-h1); sum += (h2-h1) != 0 ? (h2-h1) : 0; //printf(" sum:%d\n", sum); } } sum >= D*8 ? puts("Yes") : puts("No"); } return 0; }