#include <bits/stdc++.h>
using namespace std;
int len[100001];
int k, n, maxb, t;
int calc() {
  vector<int> inp;
  for (int i = 0; i < n; i++) {
    int m;
    cin >> m;
    inp.push_back(m);
  }
  vector<int> tmp = inp;
  sort(tmp.begin(), tmp.end());
  tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
  if (tmp.size() <= t) {
    cout << tmp.size() << endl;
    return 0;
  }
  map<int, int> code;
  for (int i = 0; i < tmp.size(); i++) code[tmp[i]] = i;
  for (int i = 0; i < inp.size(); i++) {
    inp[i] = code[inp[i]];
  }
  for (int i = 0; i < 100001; i++) len[i] = 0;
  for (int i = 0; i < t; i++) {
    for (int j = 0; j < n; j++) {
      int newVal = 1;
      if (inp[j] > 0) newVal = len[inp[j] - 1] + 1;
      for (int k = inp[j]; k < tmp.size() && len[k] < newVal; k++)
        len[k] = newVal;
    }
  }
  int ret = 0;
  for (int i = 0; i < 100001; i++)
    if (len[i] > ret) ret = len[i];
  cout << ret << endl;
  return 0;
}
int main() {
  cin >> k >> n >> maxb >> t;
  for (int i = 0; i < k; i++) {
    calc();
  }
  return 0;
}
