#### AC代码：

const int N = 1e5 + 10;const ll mod = 1e9 + 7;int a[N];int main(){  int T;  sd(T);  while (T--)  {    int n, m;    sdd(n, m);    int cnt = 0;    while (n != 0 && m != 0)    {      if (n < m)      {        int t = n;        n = m;        m = t;      }      int tmp = m;      while (tmp--)        a[++cnt] = m;      n -= m;    }    pd(cnt);    rep(i, 1, cnt)      printf("%d%c", a[i], i == cnt ? '\n' : ' ');  }  return 0;}

### D Fake News

#### AC代码：

int main(){    int t;    sd(t);    while (t--)    {        sld(n);        if (n == 1||n==24)            puts("Fake news!");        else            puts("Nobody knows it better than me!");    }}

### H Dividing（数论分块）

#### AC代码：

const int N = 2e7 + 50;const int mod = 1e9 + 7;ll n, k;ll ans;void cal(ll n, ll k){  for (ll l = 2, r; l <= k; l = r + 1)  {    r = n / l;    r = min(r, n);    if (r)      r = n / r;    else      r = k;    r = min(r, k);    int len = (r - l + 1) % mod;    int tmp = (n / l) % mod;    ans = (ans + len * 1ll * tmp % mod) % mod;  }}int main(){  sldd(n, k);  ans = (n + k - 1) % mod;  cal(n, k);  n--;  cal(n, k);  pld(ans);  return 0;}