#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define gtr(T) vector<T>,greater<T>
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void err(istream_iterator<string> it) {cerr << endl;}
template<typename T, typename... Args>void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << " = " << a << endl;err(++it, args...);}

using ll  = long long;
using pii = pair<int,int>;
using vi  = vector<int>;
using vvi = vector<vector<int>>;


const int dx[] = {0, 0, 1,  -1, 1, -1,  1, -1};
const int dy[] = {1 , -1, 0, 0, 1, -1, -1,  1};


const int N = 1e6 + 5;
const int M = 1e3 + 5;
const int MOD = 100;


signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, s1, s2;
    cin >> n >> s1 >> s2;
    bool flag = 0;
    deque<int> dq;
    for(int i = 0; i < s1; ++i){
        int x; cin >> x;
        dq.push_back(x);
        flag |= (x == 0);
    }
    vector<int> v;
    for(int i = 0; i < s2; ++i){
        int x; cin >> x;
        v.push_back(x);
    }
    if(flag){
        while(!v.empty()){
            dq.push_front(v.back());
            v.pop_back();
        }
    }else{
        for(int i = 0; i < sz(v); ++i)dq.push_back(v[i]);
    }
    int ans = 0;
    int idx = 0;
    for(int i = 0; i < sz(dq); ++i){
        if(dq[i] == 0){
            idx = i;
            break;
        }
    }
    int cur = 0;
    int i = idx + 1;
    vector<int> dp(n + 2);
    int mx = 0;
    while(i < sz(dq)){
        for(int j = idx; j < i; ++j){
            if(dq[j] < dq[i])
                dp[i] = max(dp[i], dp[j] + 1);
        }
        mx = max(mx, dp[i]);
        i++;
    }
    i = idx - 1;
    ans += mx;
    mx = 0;
    while(i >= 0){
        for(int j = idx; j > i; --j){
            if(dq[j] < dq[i])
                dp[i] = max(dp[i], dp[j] + 1);
        }
        mx = max(mx, dp[i]);
        --i;
    }
    ans += mx;
    cout << ans << '\n';

    return 0;
}