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 sum;
int n, t, k;
int b[100010];
int a[20000010];
int v[100010];
int ans;
int maxb;
int f[20000010];
map<int, int> mp;
void add(int x, int k) {
  for (int i = x; i <= maxb; i += i & -i) {
    v[i] = max(v[i], k);
  }
}
int ask(int x) {
  int res = 0;
  for (int i = x; i; i -= i & -i) {
    res = max(res, v[i]);
  }
  return res;
}
int main() {
  scanf("%d%d%d%d", &k, &n, &maxb, &t);
  while (k--) {
    memset(v, 0, sizeof(v));
    mp.clear();
    sum = 0;
    ans = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &b[i]);
      if (!mp[b[i]]) {
        sum++;
        mp[b[i]] = 1;
      }
    }
    if (t >= sum) {
      printf("%d\n", sum);
      continue;
    }
    for (int i = 1; i <= n * t; i++) {
      a[i] = b[(i - 1) % n + 1];
    }
    for (int i = 1; i <= n * t; i++) {
      f[i] = ask(a[i] - 1) + 1;
      ans = max(ans, f[i]);
      add(a[i], f[i]);
    }
    printf("%d\n", ans);
  }
}
