Buggy python submission (verdict: Time Limit Exceeded):
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.insert(0,num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
for i in range(min(len(r), len(l))):
    if r[i]==l[i]:
        print(r[i]+1)

Fixed submission:
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.append(num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
lenr=len(r)
for i in range(min(lenr, len(l))):
    if r[lenr-i-1]==l[i]:
        print(l[i]+1)

Buggy python submission (verdict: Time Limit Exceeded):
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.insert(0,num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
for i in range(min(len(r), len(l))):
    if r[i]==l[i]:
        print(r[i]+1)

Fixed submission:
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.append(num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
lenr=len(r)
for i in range(min(lenr, len(l))):
    if r[lenr-i-1]==l[i]:
        print(l[i]+1)

Buggy python submission (verdict: Time Limit Exceeded):
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
for i in range(len(s)):
    if s[i]=='o':
        sw=s
        sw=sw[:i]+'x'+sw[i+1:]
        counter=0
        num=0
        while counter<k and num<n:
            #print(num)
            if sw[num]=='o':
                counter+=1
                num+=c+1
            else:
                num+=1
        if counter<k:
            print(i+1)

Fixed submission:
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.append(num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
lenr=len(r)
for i in range(min(lenr, len(l))):
    if r[lenr-i-1]==l[i]:
        print(l[i]+1)

Buggy python submission (verdict: Time Limit Exceeded):
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
for i in range(len(s)):
    if s[i]=='o':
        sw=s
        sw=sw[:i]+'x'+sw[i+1:]
        counter=0
        num=0
        while counter<k and num<n:
            #print(num)
            if sw[num]=='o':
                counter+=1
                num+=c+1
            else:
                num+=1
        if counter<k:
            print(i+1)

Fixed submission:
nkc=list(map(int, input().split()))
s=input()
n=nkc[0]
k=nkc[1]
c=nkc[2]
l=[]
r=[]
onum=sum(1 for i in range(len(s)) if s[i]=='o')
num=0
counter=0
while counter<k and num<n:
    #print(num)
    if s[num]=='o':
        l.append(num)
        counter+=1
        num+=c+1
    else:
        num+=1
num=n-1
counter=0
while counter<k and num>=0:
    #print(num)
    if s[num]=='o':
        r.append(num)
        counter+=1
        num-=c+1
    else:
        num-=1
#print(l)
#print(r)
lenr=len(r)
for i in range(min(lenr, len(l))):
    if r[lenr-i-1]==l[i]:
        print(l[i]+1)