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;
namespace Flandre_Scarlet {
class BIT {
 public:
  int tree[155555];
  int len;
  void BuildTree(int _len) {
    len = _len;
    memset(tree, 0, sizeof(tree));
  }
  void Add(int pos, int val = 1) {
    for (int i = pos; i <= len; i += (i & (-i))) {
      tree[i] = max(tree[i], val);
    }
  }
  int Query(int pos) {
    int ans = 0;
    for (int i = pos; i > 0; i -= (i & (-i))) {
      ans = max(ans, tree[i]);
    }
    return ans;
  }
} T;
void R1(int &x) {
  x = 0;
  char c = getchar();
  int f = 1;
  while (c < '0' or c > '9') f = (c == '-') ? -1 : 1, c = getchar();
  while (c >= '0' and c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  x = (f == 1) ? x : -x;
}
int k, n, Maxb, t;
int a[155555];
void Input() {
  for (int i = 1; i <= n; ++i) R1(a[i]);
}
int b[155555];
int dp[155555];
void Soviet() {
  int sum = 0;
  for (int i = 1; i <= n; ++i) {
    if (b[a[i]] != k + 1) sum++;
    b[a[i]] = k + 1;
  }
  if (t >= sum) {
    printf("%d\n", sum);
    return;
  }
  int ans = 0;
  T.BuildTree(110000);
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= t; ++i)
    for (int j = 1; j <= n; ++j) {
      int c = T.Query(a[j] - 1) + 1;
      if (c > dp[j]) {
        dp[j] = c;
        ans = max(dp[j], ans);
        T.Add(a[j], c);
      }
      if (ans >= sum) break;
    }
  printf("%d\n", ans);
}
void IsMyWife() {
  R1(k), R1(n), R1(Maxb), R1(t);
  while (k--) {
    Input();
    Soviet();
  }
}
}  // namespace Flandre_Scarlet
int main() {
  Flandre_Scarlet::IsMyWife();
  getchar();
  getchar();
  return 0;
}
