for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            c[i][j] = (a[i] & b[j])
        }
    }

int n , m ;
vector<int> a , b;
vector<vector<int> > g ;
int dp[205][205][513] ;
int dfs(int x, int y, int cur){
    if ( y == m ) {
        return INF ;
    }
    if ( x == n ){
        return cur ;
    }
    if ( dp[x][y][cur] != -1 ) return dp[x][y][cur] ;
    int choice1 = dfs(x, y + 1, cur) ;
    int choice2 = dfs(x + 1, 0, g[x][y] | cur) ;
    return dp[x][y][cur] = min(choice1, choice2) ;
}
signed main(){
    fastio
    cin >> n >> m; 
    memset(dp, -1, sizeof dp) ;
    g = vector<vector<int> >(n, vector<int>(m)) ;
    a = vector<int>(n) ;
    b = vector<int>(m) ;
    for(int i = 0; i < n; i++){
        cin >> a[i] ;
    }
    for(int i = 0; i < m; i++){
        cin >> b[i] ;
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            g[i][j] = (a[i] & b[j]) ;
        }
    }
    int ans = dfs(0, 0, 0) ;
    cout << ans << endl;
    return 0; 
}