#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define mt make_tuple
#define mp make_pair
#define pb push_back
#define int long long
#define f first
#define s second
#define pll pair<long long, long long>
#define iii tuple<int,int,int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
const int b=305;
signed main(){
int n,k;cin>>n>>k;
vector<int> c(n); for(int i=0;i<n;i++)cin>>c[i];
for(int i=1;i<n;i++){int b;cin>>b;}
map<int, int> freq;
int ans=0;
for(int i=n-1;i>=0;i--){
ans=max(freq[c[i]]+1, ans);
freq[c[i]]++;
}
cout<<ans<<' '<<0;
}
