#include <bits/stdc++.h>
using namespace std;
int a[100010], c[100010];
int k, n, maxb, t;
int get_unique();
int calc();
int main() {
  scanf("%d%d%d%d", &k, &n, &maxb, &t);
  while (k--) {
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    if (t >= maxb) {
      printf("%d\n", get_unique());
    } else {
      printf("%d\n", calc());
    }
  }
}
int get_unique() {
  sort(a + 1, a + n + 1);
  int count = 1;
  for (int i = 2; i <= n; i++)
    if (a[i] != a[i - 1]) ++count;
  return count;
}
int getmax(int cur) {
  int ans = 0;
  while (cur) {
    ans = max(ans, c[cur]);
    cur -= (cur & (-cur));
  }
  return ans;
}
void update(int cur, int val) {
  while (cur <= maxb) {
    c[cur] = max(c[cur], val);
    cur += (cur & (-cur));
  }
}
int calc() {
  static int ans[100010];
  memset(ans, 0, sizeof ans);
  memset(c, 0, sizeof c);
  for (int i = 1; i <= t; i++)
    for (int j = 1; j <= n; j++) {
      int now = getmax(a[j] - 1) + 1;
      if (now > ans[j]) {
        ans[j] = now;
        update(a[j], now);
      }
    }
  int maxn = 0;
  for (int i = 1; i <= n; i++) maxn = max(ans[i], maxn);
  return maxn;
}
