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 a[100100], n, mx, t, q, tmp[100100];
int f[100100], fen[100100];
void add(int x, int y) {
  while (x <= mx) {
    fen[x] = max(fen[x], y);
    x += x & -x;
  }
}
int calc(int x) {
  int rt = 0;
  while (x) {
    rt = max(rt, fen[x]);
    x -= x & -x;
  }
  return rt;
}
int run() {
  if (t >= mx) return mx;
  memset(fen, 0, sizeof(fen));
  memset(f, 0, sizeof(f));
  for (int j = 0; j < t; j++) {
    for (int i = 1; i <= n; i++) {
      int x = a[i];
      int tp = calc(x - 1) + 1;
      add(x, tp);
      if (f[x] < tp) f[x] = tp;
    }
  }
  int rt = 0;
  for (int i = 1; i <= mx; i++)
    if (rt < f[i]) rt = f[i];
  return rt;
}
int main() {
  scanf("%d%d%d%d", &q, &n, &mx, &t);
  while (q--) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", a + i);
      tmp[i - 1] = a[i];
    }
    mx = n;
    sort(tmp, tmp + mx);
    mx = unique(tmp, tmp + mx) - tmp;
    for (int i = 1; i <= n; i++) {
      a[i] = lower_bound(tmp, tmp + mx, a[i]) - tmp + 1;
    }
    printf("%d\n", run());
  }
  return 0;
}
