1 #include <bits/stdc++.h>
 2 using namespace std;
 3 #define vii vector<int>::iterator
 4 #define M0(a) memset(a, 0, sizeof(a))
 5 #define repf(i, a, b) for (int i = (a); i <= (b); ++i) 
 6 int a[101010], b[101010], n, m, s, e;
 7 int f[301];
 8 vector<int> p[101010];
 9 
10 void init(){
11     repf(i, 1, n) scanf("%d", &a[i]);
12     repf(i, 1, m) scanf("%d", &b[i]);
13     for (int i = 0; i <= 100000; ++i) p[i].clear();
14     repf(i, 1, m) p[b[i]].push_back(i);
15 }
16 
17 void solve(){
18     int t = s / e;
19 //    cout << t << endl;
20     for (int i = 0; i <= t; ++i) f[i] = m+1;
21     f[0] = 0;
22     int ans = 0;
23     for (int i = 0; i < n; ++i){
24         for (int j = t; j >= 0; --j) if (f[j] <= m){
25                vii it = upper_bound(p[a[i+1]].begin(), p[a[i+1]].end(), f[j]);
26                if (it != p[a[i+1]].end()) f[j+1] = min(f[j+1], *it);
27         }
28         for (int j = 0; j <= t; ++j) if (f[j] <= m)
29              if (j * e + f[j] + i + 1 <= s) ans = max(ans, j);    
30     }
31     cout << ans << endl;
32 }
33 
34 int main(){
35 //    freopen("a.in", "r", stdin);
36     while (scanf("%d%d%d%d", &n, &m, &s, &e) != EOF){
37           init();
38           solve();
39     }
40 }