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;
bool __hack = std::ios::sync_with_stdio(false);
auto __hack1 = cin.tie(nullptr);
template <class T>
T next(istream& in) {
  T ret;
  in >> ret;
  return ret;
}
template <class T>
vector<T> nextVec(istream& in, size_t n) {
  vector<T> ret(n);
  for (size_t i = 0; i < n; ++i) {
    ret[i] = next<T>(in);
  }
  return ret;
}
void solve(istream& in, ostream& out) {
  int k = next<int>(in);
  int n = next<int>(in);
  next<int>(in);
  int t = next<int>(in);
  for (int test = 0; test < (k); ++test) {
    vector<int> b = nextVec<int>(in, n);
    vector<int> sorted_b(b.begin(), b.end());
    sort(sorted_b.begin(), sorted_b.end());
    sorted_b.resize(unique(sorted_b.begin(), sorted_b.end()) -
                    sorted_b.begin());
    if (t >= sorted_b.size()) {
      out << sorted_b.size() << endl;
      continue;
    }
    for (int i = 0; i < n; ++i) {
      b[i] = (int)(lower_bound(sorted_b.begin(), sorted_b.end(), b[i]) -
                   sorted_b.begin());
    }
    vector<int> dp(sorted_b.size());
    for (int it = 0; it < (t); ++it) {
      for (int i : b) {
        int cur = i == 0 ? 0 : dp[i - 1];
        for (int j = i; j < sorted_b.size() && dp[j] == cur; ++j) {
          dp[j]++;
        }
      }
    }
    int res = 0;
    for (int x : dp) {
      res = max(res, x);
    }
    out << res << endl;
  }
}
int main() {
  solve(cin, cout);
  return 0;
}
