#include <bits/stdc++.h>
using namespace std;
const int INT_INF = (1U << 31) - 10;
const int MAX_B = 100010, MAX_N = 100010;
int b[MAX_N];
int dp[MAX_N];
set<int> s;
int main(int argc, char *argv[]) {
  int K, N, maxb, T;
  cin >> K >> N >> maxb >> T;
  for (int k = 0; k < K; k++) {
    s.clear();
    for (int i = 0; i < N; i++) {
      scanf("%d", &(b[i]));
      s.insert(b[i]);
    }
    if (T >= s.size()) {
      printf("%ld\n", s.size());
      continue;
    }
    fill(dp, dp + MAX_N, INT_INF);
    for (int i = 0; i < T; i++) {
      for (int j = 0; j < N; j++) {
        if (b[j] < i) continue;
        *lower_bound(dp, dp + N, b[j]) = b[j];
      }
    }
    printf("%ld\n", lower_bound(dp, dp + N, INT_INF) - dp);
  }
  return 0;
}
