Maxim loves sequences, especially those that strictly increase. He is wondering, what is the length of the longest increasing subsequence of the given sequence a?

Sequence a is given as follows: 

  * the length of the sequence equals n × t; 
  * <image> (1 ≤ i ≤ n × t), where operation <image> means taking the remainder after dividing number x by number y. 



Sequence s1, s2, ..., sr of length r is a subsequence of sequence a1, a2, ..., an, if there is such increasing sequence of indexes i1, i2, ..., ir (1 ≤ i1 < i2 < ... < ir ≤ n), that aij = sj. In other words, the subsequence can be obtained from the sequence by crossing out some elements.

Sequence s1, s2, ..., sr is increasing, if the following inequality holds: s1 < s2 < ... < sr.

Maxim have k variants of the sequence a. Help Maxim to determine for each sequence the length of the longest increasing subsequence.

Input

The first line contains four integers k, n, maxb and t (1 ≤ k ≤ 10; 1 ≤ n, maxb ≤ 105; 1 ≤ t ≤ 109; n × maxb ≤ 2·107). Each of the next k lines contain n integers b1, b2, ..., bn (1 ≤ bi ≤ maxb). 

Note that for each variant of the sequence a the values n, maxb and t coincide, the only arrays bs differ.

The numbers in the lines are separated by single spaces.

Output

Print k integers — the answers for the variants of the sequence a. Print the answers in the order the variants follow in the input.

Examples

Input

3 3 5 2
3 2 1
1 2 3
2 3 1


Output

2
3
3
#include <bits/stdc++.h>
using namespace std;
int stmp;
const int MAXB = 100000;
const int INF = 1000000001;
int vis[MAXB + 1];
vector<int> arr;
int k, n, maxb, t, _t;
int z;
inline int lis() {
  vector<int> L(z, INF);
  for (int s = 0; s < (t); ++s) {
    for (int i = 0; i < ((int)(arr).size()) && L.back() == INF; ++i)
      *lower_bound((L).begin(), (L).end(), arr[i]) = arr[i];
    int c = 0;
    for (int i = 0; i < (((int)(arr).size())); ++i)
      if (arr[i] == L[s])
        ++c;
      else
        arr[i - c] = arr[i];
    arr.erase(arr.end() - c, arr.end());
  }
  return find((L).begin(), (L).end(), INF) - L.begin();
}
int main(int argc, char *argv[]) {
  stmp = scanf("%d %d %d %d", &k, &n, &maxb, &_t);
  for (int c = (1); c <= (k); ++c) {
    arr.resize(n);
    int rb = 0;
    for (int i = 0; i < (n); ++i) {
      stmp = scanf("%d", &arr[i]);
      if (vis[arr[i]] != c) ++rb;
      vis[arr[i]] = c;
    }
    arr.resize(unique((arr).begin(), (arr).end()) - arr.begin());
    z = rb;
    t = min(_t, z);
    printf("%d\n", t < z ? lis() : z);
  }
  return 0;
}
