#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;
template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
out << c.first << ' ' << c.second;
return out;
}
template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
const int sz = v.size();
for (int i = 0; i < sz; i++) {
if (i) out << ' ';
out << v[i];
}
return out;
}
template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
for (T &x : v) in >> x;
return in;
}
template<typename T, typename U>
istream & operator >> (istream &in, pair<T, U> &c) {
in >> c.first;
in >> c.second;
return in;
}
template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}
const int mxn = 1e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
pair<int, int> d[mxn * 4];
int lz[mxn * 4], p[mxn], q[mxn], pos[mxn];
pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
if(a.ff < b.ff) return b;
if(a.ff == b.ff) return make_pair(a.ff, a.ss + b.ss);
return a;
}
void build(int l, int r, int i) {
if(l == r) {
d[i] = {0, 1};
return;
}
int m = (l + r) / 2;
build(l, m, i * 2);
build(m + 1, r, i * 2 + 1);
d[i] = merge(d[i * 2], d[i * 2 + 1]);
}
void pro(int i, int l, int r) {
if(lz[i] == 0) return;
d[i].ff += lz[i];
if(l < r) {
lz[i * 2] += lz[i];
lz[i * 2 + 1] += lz[i];
}
lz[i] = 0;
}
void update(int l, int r, int i, int x, int y, int c) {
pro(i, l, r);
if(l >= x && r <= y) {
lz[i] += c;
pro(i, l, r);
return;
}
if(l > y || r < x) return;
int m = (l + r) / 2;
update(l, m, i * 2, x, y, c);
update(m + 1, r, i * 2 + 1, x, y, c);
d[i] = merge(d[i * 2], d[i * 2 + 1]);
}
void go() {
int n, k, Q;
cin >> n >> k >> Q;
for(int i = 1; i <= n; i++) {
cin >> p[i];
pos[p[i]] = i;
}
for(int i = 1; i <= n; i++) {
cin >> q[i];
}
build(1, n, 1);
pair<int, int> ans{0, 0};
for(int i = 1; i <= n; i++) {
int l = max(k, pos[q[i]]), r = min(n, pos[q[i]] + k - 1);
update(1, n, 1, l, r, 1);
if(i - k > 0) {
l = max(k, pos[q[i - k]]), r = min(n, pos[q[i - k]] + k - 1);
update(1, n, 1, l, r, -1);
}
if(i >= k) {
ans = merge(ans, d[1]);
}
}
cout << ans << endl;
}
signed main() {
fast;
int t = 1;
// cin >> t;
while(t--) {
go();
}
return 0;
}
