func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = 1000000007;   const int UNDEF = -1;   const long long INF = 1e18;   template <typename T>   inline bool chkmax(T &aa, T bb) {     return aa < bb ? aa = bb, true : false;   }   template <typename T>   inline bool chkmin(T &aa, T bb) {     return aa > bb ? aa = bb, true : false;   }   int rint();   char rch();   long long rlong();   void makeunique(vector<int> &vx) {     sort(vx.begin(), vx.end());     auto it = unique(vx.begin(), vx.end());     vx.resize(std::distance(vx.begin(), it));   }   int bins(vector<int> &vx, int x) {     int imin = 0, imax = vx.size();     while (imin < imax) {       int imid = (imin + imax) >> 1;       if (vx[imid] < x)         imin = imid + 1;       else         imax = imid;     }     return imin;   }   const int mn = 2e7 + 2;   int f[mn];   int longest_strictly_increasing_subsequence(vector<int> &p, int maxval,                                               int repeats) {     memset(f, 0, sizeof(int) * (maxval + 1));     for (int r = 0; r < repeats; r++) {       for (auto &x : p) {         int best = f[x - 1] + 1;         for (int y = x; y <= maxval; y++) {           if (f[y] < best)             f[y] = best;           else             break;         }       }     }     return f[maxval];   }   int compress(vector<int> &vinp) {     vector<int> bintable = vinp;     makeunique(bintable);     for (auto &w : vinp) {       w = bins(bintable, w) + 1;     }     return (int)bintable.size();   }   int n, t;   vector<int> b;   void solve() {     for (int i = 0; i < n; i++) b[i] = rint();     int maxval = compress(b);     int ans = longest_strictly_increasing_subsequence(b, maxval, min(t, maxval));     printf( %d n , ans);   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     int numtests, maxb;     numtests = rint(), n = rint(), maxb = rint(), t = rint();     b.resize(n);     for (int test = 0; test < numtests; test++) solve();   }   static char stdinBuffer[1024];   static char *stdinDataEnd = stdinBuffer + sizeof(stdinBuffer);   static const char *stdinPos = stdinDataEnd;   void readAhead(size_t amount) {     size_t remaining = stdinDataEnd - stdinPos;     if (remaining < amount) {       memmove(stdinBuffer, stdinPos, remaining);       size_t sz = fread(stdinBuffer + remaining, 1,                         sizeof(stdinBuffer) - remaining, stdin);       stdinPos = stdinBuffer;       stdinDataEnd = stdinBuffer + remaining + sz;       if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0;     }   }   int rint() {     readAhead(16);     int x = 0;     bool neg = false;     while (*stdinPos ==     || *stdinPos ==   n ) ++stdinPos;     if (*stdinPos ==  - ) {       ++stdinPos;       neg = true;     }     while (*stdinPos >=  0  && *stdinPos <=  9 ) {       x *= 10;       x += *stdinPos -  0 ;       ++stdinPos;     }     return neg ? -x : x;   }   char rch() {     readAhead(16);     while (*stdinPos ==     || *stdinPos ==   n ) ++stdinPos;     char ans = *stdinPos;     ++stdinPos;     return ans;   }   long long rlong() {     readAhead(32);     long long x = 0;     bool neg = false;     while (*stdinPos ==     || *stdinPos ==   n ) ++stdinPos;     if (*stdinPos ==  - ) {       ++stdinPos;       neg = true;     }     while (*stdinPos >=  0  && *stdinPos <=  9 ) {       x *= 10;       x += *stdinPos -  0 ;       ++stdinPos;     }     return neg ? -x : x;   }   