import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N, K = NMI()
    K -= 1
    S = SI()
    D = deque()
    for i, s in enumerate(S):
        if s == "(":
            D.append(i)
        else:
            x = D.pop()
            if x == K:
                print(i+1)
                return
            if i == K:
                print(x+1)
                return


if __name__ == "__main__":
    main()