// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A, int[] B) {
        // write your code in Java SE 8
    }
}

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    pass

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    for i in range(len(B)):
        if B[]

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[]

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        elif stack != []:
            

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        elif stack != []:
            if A[i] > A[stack[-1]]:
                

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        elif stack != []:
            if A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            if stack != [] and A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            if stack != [] and A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            if stack != [] and A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            if stack != [] and A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            else:
                

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != [] and A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            else:
                

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                if A[i] > A[stack[-1]]:
                Sum -= 1
                stack.pop()
            else:
                

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                if A[i] > A[stack[-1]]:
                    stack.pop()
                Sum -= 1
    return Sum

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                if A[i] > A[stack[-1]]:
                Sum -= 1
                    stack.pop()
    return Sum

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                Sum -= 1
                if A[i] > A[stack[-1]]:
                    stack.pop()
                else:
                    break
    return Sum

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                Sum -= 1
                if A[i] > A[stack[-1]]:
                    stack.pop()
                else:
                    break
    return Sum

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                Sum -= 1
                if A[i] > A[stack[-1]]:
                    stack.pop()
                else:
                    break
    return Sum

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A, B):
    # write your code in Python 3.6
    stack = []
    Sum = len(B)
    for i in range(len(B)):
        if B[i] == 1:
            stack.append(i)
        else:
            while stack != []:
                Sum -= 1
                if A[i] > A[stack[-1]]:
                    stack.pop()
                else:
                    break
    return Sum