qyliang/CodeNanoFix huggingface dataset:
Buggy code:
import sys

S = input()
T = "abc"
if len(S) > 3:
  print("No")
else:
  for i in S:
    if i in T:
      T.replace(i,'')
    else:
      print("No")
      sys.exit()
  print("Yes")

Fixed code:
import sys

S = input()
T = "abc"
if len(S) > 3:
  print("No")
else:
  for i in S:
    if i in T:
      T = T.replace(i,'')
    else:
      print("No")
      sys.exit()
  print("Yes")
Buggy code:
s = str(input())
a = s.count(a)
b = s.count(b)
c = s.count(c)
if a == b == c == 1:
  print('Yes')
else:
  print('No')

Fixed code:
s = str(input())
a = s.count('a')
b = s.count('b')
c = s.count('c')
if a == b == c == 1:
  print('Yes')
else:
  print('No')
Buggy code:
S = input()
A = S.count('a')
B = S.count('b')
C = S.count('c')
if a == b == c == 1:
  print('Yes')
else
:
  print('No')

Fixed code:
S = input()
A = S.count('a')
B = S.count('b')
C = S.count('c')
if A == B == C == 1:
  print('Yes')
else:
  print('No')
Buggy code:
def abc(s):
    word = list(s)
    print(word)
    if word[0] != word[1] and word[0] != word[2] and word[1] != word[2]:
        print("Yes")
    else:
        print("No")

S = input("S:")
abc(S)


Fixed code:
def abc(s):
    word = list(s)
    if word[0] != word[1] and word[0] != word[2] and word[1] != word[2]:
        print("Yes")
    else:
        print("No")

S = input()
abc(S)
Buggy code:
print('Yes' if sorted.input()=='abc' else 'No' )

Fixed code:
print('Yes' if ''.join(sorted(input()))=='abc' else 'No' )
Buggy code:
s = sorted(input())
if s == ["a","b","c"]:
    print("Yes")
else:
    print("No")
print(s)

Fixed code:
s = sorted(list(input()))
if s == ['a', 'b', 'c'] :
    print('Yes')
else:
    print('No')
Buggy code:
["Yes","No"][len(set(input())<3]

Fixed code:
print(["Yes","No"][len(set(input()))<3])
Buggy code:
S = input()
print(sorted(S))
if "".join(sorted(S)) == "abc":
  print("Yes")
else:
  print("No")

Fixed code:
S = input()
if "".join(sorted(S)) == "abc":
  print("Yes")
else:
  print("No")
Buggy code:
s = input()

if s.count("a") and s.count("b"):
  if s.count("c") and len(s) == 3:
    print("Yes")
  else:
    print("no")
else:
  print("no")

Fixed code:
s = input()
 
if s.count("a") and s.count("b"):
  if s.count("c") and len(s) == 3:
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy code:
a = "baa"
if a in ["abc","acb","bac","bca","cab","cba"]: #== ("abc" or "acb" or "bac" or "bca" or "cab" or "cba"):
  print("Yes")
else:
  print("No")

Fixed code:
a = input()
if a in ["abc","acb","bac","bca","cab","cba"]: #== ("abc" or "acb" or "bac" or "bca" or "cab" or "cba"):
  print("Yes")
else:
  print("No")
Buggy code:
import collections
counter = collections.Counter()

for i in input():
  counter[i] += 1
  
if len([i for i in counter.values() if i >= 1]) == 3:
  print*"Yes")
else:
  print("No")

Fixed code:
import collections
counter = collections.Counter()

for i in input():
  	counter[i] += 1

if len([i for i in counter.values() if i >= 1]) == 3:
	print("Yes")
else:
    print("No")
Buggy code:
s=input()
#sl=["a","b","c"]
if s[0]!=s[1] and s[0]!=s[2] and s[2]!=s[2]:
  print("Yes")
else:
  print("No")

Fixed code:
s=input()
#sl=["a","b","c"]
if s[0]!=s[1] and s[0]!=s[2] and s[1]!=s[2]:
  print("Yes")
else:
  print("No")
Buggy code:
a = [i for i in input()]
if a[0] != a[1] and a[1] != a[2]:
  print("Yes")
else:
  print("No")

Fixed code:
a = [i for i in input()]
if a[0] != a[1] and a[1] != a[2] and a[2] != a[0]:
  print("Yes")
else:
  print("No")
Buggy code:
a=input()
print('Yes'if a[0]!=a[1]and a[0]!=a[2]and a[1]!=a[2]else'No)

Fixed code:
a=input()
print('Yes'if a[0]!=a[1]and a[0]!=a[2]and a[1]!=a[2]else'No')
Buggy code:
s = list(input())

s.sort()
if (s == "abc"):
  print("Yes")
else :
  print("No")

Fixed code:
s = input()
s = list(s)
s.sort()
ans = list("abc")
if (s == ans):
  print("Yes")
else :
  print("No")
Buggy code:
s = input()
if "a" in s ans "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Fixed code:
s = input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")
Buggy code:
s = str(input())
a = {a,b,c}
if set(s) == a:
  print("Yes")
else:
  print("No")

Fixed code:
s = str(input())
a = {"a","b","c"}
if set(s) == a:
  print("Yes")
else:
  print("No")
Buggy code:
print("Yes" if set(input()) == {a,b,c} else "No")

Fixed code:
print("Yes" if set(input()) == {"a","b","c"} else "No")
Buggy code:
S=input()
print("Yes" if S[0]==S[1] or S[0]==S[2] or S[1]==S[2] else "No")

Fixed code:
S=input()
print("No" if S[0]==S[1] or S[0]==S[2] or S[1]==S[2] else "Yes")
Buggy code:
l=["".join(i) for i in itertools.permutations("abc")]
if input() in l:
  print("Yes")
else:
  print("No")

Fixed code:
import itertools
l=["".join(i) for i in itertools.permutations("abc")]
if input() in l:
  print("Yes")
else:
  print("No")
Buggy code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    s = ns()
    
    if set(s) == set([a, b, c]):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Fixed code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    s = ns()
    
    if set(s) == set(['a', 'b', 'c']):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()
Buggy code:
x=list(input())
#print(x)
y=sorted(x)
#print(sorted(x))
if y[0] == y[1]:
	print("No")
else:
	print("Yes")


Fixed code:
x=list(input())
#print(x)
y=sorted(x)
#print(sorted(x))
if y[0] == y[1] or y[1] == y[2]:
	print("No")
else:
	print("Yes")
Buggy code:
from itertools import permutations
from sys import exit
S=input()
for s in permutations('abc'):
  if S == s:
    print('Yes')
    exit(0)
print('No')

Fixed code:
from itertools import permutations
from sys import exit
S=input()
for s in permutations('abc'):
  if S == ''.join(s):
    print('Yes')
    exit(0)
print('No')
Buggy code:
a = input()
if a[0]==a[1] or a[1]==a[2]:
  print("No")
else:
  print("Yes")

Fixed code:
a = input()
if a[0]==a[1] or a[1]==a[2] or a[2]==a[0]:
  print("No")
else:
  print("Yes")
Buggy code:
s = input()
c = 0
for i in 'abc': if s.count(i) == 1: c += 1
print('Yes' if c == 3 else 'No')

Fixed code:
s = input()
c = 0
for i in 'abc':
  if s.count(i) == 1:
    c += 1
print('Yes' if c == 3 else 'No')
Buggy code:
s=input()
ans=[0,0,0]
for i in range(3):
  if s[i]=='a':
    ans[0]+=1
  elif s[i]=='b':
    ans[1]+=1
  else:
    ans[2]+=1
if ans[0]==1 and ans[1]==1 and ans[2]==1:
  print("Yes")
else:
  print("No)

Fixed code:
s=input()
ans=[0,0,0]
for i in range(3):
  if s[i]=='a':
    ans[0]+=1
  elif s[i]=='b':
    ans[1]+=1
  else:
    ans[2]+=1
if ans[0]==1 and ans[1]==1 and ans[2]==1:
  print("Yes")
else:
  print("No")
Buggy code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8')
print('Yes' if set('abc') == set(S) else 'No')


Fixed code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8').rstrip()
print('Yes' if set('abc') == set(S) else 'No')
Buggy code:
S = input()
if S[0] != S[1] and S[0] != S[2] and S[1] != S[2]:
  print('Yes')
else:
  print('No)

Fixed code:
S = input()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
      print("Yes")
else:
  print("No")
Buggy code:
s = input()
print("Yes" if len(s) == 3 else "No")


Fixed code:
s=input()
print('Yes' if len(set(s)) == 3 else 'No')
Buggy code:
S = input()

if "a" not in S:
  print("No")
  exit()

if "b" not in S:
  print("No")
  exit()

if "c" not in S:
  print("No")
  exit()

 print("Yes")

Fixed code:
S = input()

if "a" not in S:
  print("No")
  exit()

if "b" not in S:
  print("No")
  exit()

if "c" not in S:
  print("No")
  exit()

print("Yes")
Buggy code:

S = list(input())
print(S)

if S.count('a') ==1 and S.count('b') and S.count('c'):
    print('Yes')
else:
    print('No')

Fixed code:

S = list(input())

if S.count('a') ==1 and S.count('b') and S.count('c'):
    print('Yes')
else:
    print('No')
Buggy code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


s = list(input())
if list(s.sort()) == ['a','b','c']:
    print('Yes')
else:
    print('No')


Fixed code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


s = list(input())
s.sort()
if s == list('abc'):
    print('Yes')
else:
    print('No')
Buggy code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    s = str(input())
    if len(set(s[0], s[1], s[2])) == 3:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()


Fixed code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    s = str(input())
    if len(set([s[0], s[1], s[2]])) == 3:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()
Buggy code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = input()
print("Yes" if s.count["a"]*s.count["b"]*s.count["c"] == 1 else "No")

Fixed code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = input()
print("Yes" if s.count("a")*s.count("b")*s.count("c") == 1 else "No")
Buggy code:
s = list(input())
s.sort()
if s == 'abc':
    print('Yes')
else:
    print('No')

Fixed code:
s = list(input())
s.sort()
s = ''.join(s)
if s == "abc":
    print('Yes')
else:
    print('No')
Buggy code:
d = list(input())

for i in range(3):
  if d[i] == "a":
    a = 1
  if d[i] == "b":
    b = 1
  if d[i] == "c":
    c = 1
    
    
if a*b*c == 1:
  print("Yes")
else:
  print("No")


Fixed code:
d = list(input())
a = 0
b = 0
c = 0
for i in range(3):
  if d[i] == "a":
    a = 1
  if d[i] == "b":
    b = 1
  if d[i] == "c":
    c = 1
    
    
if a*b*c == 1:
  print("Yes")
else:
  print("No")
Buggy code:
# coding : utf-8

import numpy as np

A = input()

if(A[0]!=A[1] and A[0]!=A[2] and A[1]!=A[2])
	print("Yes")
else:
	print("No")

Fixed code:
# coding : utf-8

import numpy as np

A = input()

if(A[0]!=A[1] and A[0]!=A[2] and A[1]!=A[2]):
	print("Yes")
else:
	print("No")
Buggy code:
s=input()
print("Yes"if s[0]!=s[1]!=s[2] else "No")

Fixed code:
s=input()
print("Yes"if s[0]!=s[1] and s[0]!=s[2] and s[1]!=s[2] else "No")
Buggy code:
s=sorted(input())
ans="abc"
flag=1
for i in range(3)
	if s[i] != ans[i]:
    	print("No")
        flag=0
    	break
if flag==1:
  print("Yes")




Fixed code:
s=sorted(input())
ans="abc"
flag=1
for i in range(3):
  if s[i] != ans[i]:
    print("No")
    flag=0
    break

if flag==1:
  print("Yes")
Buggy code:
# coding: utf-8
import re
S = input()
find_a= re.findall("a")
find_b = re.findall("b")
find_c = re.findall("c")
if find_a and find_b and find_c:
    print("Yes")
else:
    print("No")

Fixed code:
# coding: utf-8
import re
S = input()
find_a = re.findall("a",S)
find_b = re.findall("b",S)
find_c = re.findall("c",S)
if find_a and find_b and find_c:
    print("Yes")
else:
    print("No")
Buggy code:
s = str(input())

print('Yes' if s.count(a)==1 and c.count(b)==1 else 'No')

Fixed code:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')
Buggy code:
S=str(input())
if 'a'.count == 1 and 'b'.count == 1 and 'c'.count == 1:
    print('Yes')
else:
    print('No')

Fixed code:
S = input()

if S.count('a') == 1 and S.count('b') == 1 and\
    S.count('c') == 1:
    print('Yes')
else:
    print('No')
Buggy code:
s = input(s)
l = ['a','b','c']
for c in s:
  l.remove(c)
print('Yes' if l ==[] else 'No')

Fixed code:
s = input()
l = ['a','b','c']
for c in s:
  if c in l:
    l.remove(c)
print('Yes' if l ==[] else 'No')
Buggy code:
n = set(list(input()))
n.sort()
if 'abc' == ''.join(n):
  print("Yes")
else:
  print("No")

Fixed code:
n = list(set(list(input())))
n.sort()
if 'abc' == ''.join(n):
  print("Yes")
else:
  print("No")
Buggy code:
s = sort(input())
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
	print('Yes')
else:
	print('No')

Fixed code:
s = sorted(input())
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
	print('Yes')
else:
	print('No')
Buggy code:
s = input()

print("Yes" s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1 else "No")

Fixed code:
s = input()

print("Yes" if s.count("a") == 1
            and s.count("b") == 1 
            and s.count("c") == 1
            else "No")
Buggy code:
s=input()
print("Yes" if """a" in s and "b" in s and "c""" else "No")

Fixed code:
s=input()
print("Yes" if "a" in s and "b" in s and "c" in s else "No")
Buggy code:
S=input()
print('Yes' if len(S)==3 else 'No')

Fixed code:
S=input()
print('Yes' if len(set(S))==3 else 'No')
Buggy code:
print("Yes" if len(input())==3 else "No")

Fixed code:
print("Yes" if len(set(input()))==3 else "No")
Buggy code:
s=input()
if s[0]!=s[1] and s[1]!=s[2]:
    print("Yes")
else:
    print("No")

Fixed code:
s=input()
if s[0]!=s[1] and s[1]!=s[2] and s[2]!=s[0]:
    print("Yes")
else:
    print("No")
Buggy code:
s = input()
if s[0] != s[1] != s[2]:
    print('Yes')
else:
    print('No')


Fixed code:
s = input()
if s[0] != s[1] and s[0] != s[2] and s[1] != s[2]:
    print('Yes')
else:
    print('No')
Buggy code:
s=input()
if a in s and b in s and c in s:
    print("Yes")
else:
    print("No")

Fixed code:
s=input()

a=('a' in s)
b=('b' in s)
c=('c' in s)

if a==True and b==True and c==True:
    print('Yes')
else:
    print('No')
Buggy code:
if ("".join(sorted(input())) == "abc):
    print("Yes")
else:
    print("No")

Fixed code:
if ("".join(sorted(input())) == "abc"):
    print("Yes")
else:
    print("No")
Buggy code:
str = input()
if "a" in str and "b in str and "c"  str:
  print("Yes")
else: 
  print("No")

Fixed code:
str = input()
if "a" in str and "b" in str and "c"  in str:
  print("Yes")
else: 
  print("No")
Buggy code:
s=input()
s=s.sorted()
if s=='abc':
  print('Yes')
else:
  print('No')

Fixed code:
s = input()
if 'abc' == ''.join(sorted(s)):
    print('Yes')
else:
    print('No')
Buggy code:
s = input()

s = set(s)

if s.len() == 3:
  print("Yes")
else:
  print("No")


Fixed code:
s = input()

s = set(s)

if len(s) == 3:
  print("Yes")
else:
  print("No")
Buggy code:
S = input()
if set(S) == {'a', 'b', 'c'}:   
    print('Yes')                   
else:                             

Fixed code:
S = input()
if set(S) == {'a', 'b', 'c'}:
    print('Yes')
else:
    print('No')
Buggy code:
s = input()
a = set(a)
if len(a) == 3:
  print("Yes")
else:
  print("No")

Fixed code:
s = input()
a = set(s)
if len(a) == 3:
  print("Yes")
else:
  print("No")
Buggy code:
s=input()
if s.join(sorted(s))=='abc':
    print('Yes')
else:
    print('No')

Fixed code:
sSorted = sorted(input())
if ''.join(sSorted) =="abc":
  print("Yes")
else:
  print("No")
Buggy code:
print("Yes" if len(set(input()) == 3 else "No")

Fixed code:
if len(set(input()))==3:
  print("Yes")
else:
  print("No")
Buggy code:
S = sorted(input())

if S==[a,b,c]:
  print("Yes")
else:
  print("No")


Fixed code:
S = sorted(input())

if S==["a","b","c"]:
  print("Yes")
else:
  print("No")
Buggy code:
a=list(input().split())
print("Yes" if a[0]!=a[1] and a[0]!=a[2] and a[1]!=a[2] else "No")

Fixed code:
a=list(input())
print("Yes" if a[0]!=a[1] and a[0]!=a[2] and a[1]!=a[2] else "No")
Buggy code:
print("Yes" if sorted(input()).join("") == "abc" else "No")

Fixed code:
print("Yes" if "".join(sorted(input())) == "abc" else "No")
Buggy code:
S = input()
if len(set(S[0], S[1], S[2])) == 3:
    print("Yes")
else:
    pritn("No")


Fixed code:
S = input()
if len(set((S[0], S[1], S[2]))) == 3:
    print("Yes")
else:
    print("No")
Buggy code:
a = input()
if a[0] != a[1] != a[2]:
    print("Yes")
else:
    print("No")

Fixed code:
a = input()
if a[0] != a[1] != a[2] and a[0] != a[2]:
    print("Yes")
else:
    print("No")
Buggy code:
s = input()

for c in s:
    if c == 'a':
        r = 1
    if c == 'b':
        r = 2
    if c == 'c':
        r = 4

if r = 7:
    print('Yes')
else:
    print('No')

Fixed code:
s = input()
r = 0

for c in s:
    if c == 'a':
        r += 1
    if c == 'b':
        r += 2
    if c == 'c':
        r += 4

if r == 7:
    print('Yes')
else:
    print('No')
Buggy code:
s = input
if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1:
  print("Yes")
else:
  print("No")

Fixed code:
s = input()
if s.count('a') and s.count('b') and s.count('c'):
    print('Yes')
else:
    print('No')
Buggy code:
s = input().rstrip()

if s[0] != s[1] != s[2]:
    print('Yes')
else:
    print('No')


Fixed code:
s = input().rstrip()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
    print('Yes')
else:
    print('No')
Buggy code:
s = input()
a = ["abc","acb","bac","bca","cab","cba"]
print["No","Yes"][s in a]

Fixed code:
s = input()
a = ["abc","acb","bac","bca","cab","cba"]
print(["No","Yes"][s in a])
Buggy code:
a = input()
if join(sorted(a))=="abc":
  print("Yes")
else:
  print("No")

Fixed code:
a = input()
if "".join(sorted(a))=="abc":
  print("Yes")
else:
  print("No")
Buggy code:
n=list(input())
if a in n and b in n and c in n:
  print("Yes")
else:
  print("No")

Fixed code:
a = list(input())
if 'a' in a and 'b' in a and 'c' in a:
    print('Yes')
else:
    print('No')
Buggy code:
s = input()
a = s.count("a")
b = s.count("b")

print("Yes") if (a and b) else print("No")

Fixed code:
s = input()
a = s.count("a")
b = s.count("b")

print("Yes") if (a==1 and b==1) else print("No")
Buggy code:
a, b, k = map(int, input().split())
for i in range(k):
    print(a+i)
for i in range(k):
    print(b-k+i+1)

Fixed code:
a, b, k = map(int, input().split())
for i in range(a, min(a+k,b+1)):
  print(i)
for i in range(max(a+k, b-k+1), b+1):
  print(i)
Buggy code:
a,b,k = tuple(map(int,input().split()))
s = set([])
for i in range(a,a+k):
  s.add(i)
for i in range(b,b-k,-1):
  s.add(i)
  
s = sorted(list(s))
for i in s:
  print(i)

Fixed code:
a,b,k = tuple(map(int,input().split()))
s = set([])
for i in range(min(k,b-a+1)):
  s.add(a+i)
  s.add(b-i)

  
s = sorted(list(s))
for i in s:
  print(i)
Buggy code:
# ABC93, B - small and large integers
a, b, k = map(int, input().split(' '))


if k >= (b-a+1)/2:
    [print(x) for x in range(a, b+1)]
else:
    [print(x) for x in range(a, a+k)]
    [print(x) for x in range(b-k, b)]


Fixed code:
# ABC93, B - small and large integers
a, b, k = map(int, input().split(' '))


if k >= (b-a+1)/2:
    [print(x) for x in range(a, b+1)]
else:
    [print(x) for x in range(a, a+k)]
    [print(x) for x in range(b-k+1, b+1)]
Buggy code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,k = f()
    s = set()
    for i in range(a, a+k):
        s.add(i)

    for i in range(b+1-k, b+1):
        s.add(i)
    
    for i in s:
        print(i)

solve()


Fixed code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,k = f()
    s = set()
    for i in range(a, min(a+k, b)):
        s.add(i)
    

    for i in range(max(a,b+1-k), b+1):
        s.add(i)
    
    s = sorted(list(s))
    for i in s:
        print(i)

solve()
Buggy code:
A, B, K = map(int, input().split())
candidate1 = [i for i in range(A, A+K) if i <= B]
candidate2 = [i+1 for i in range(B-K, B) if i+1 >= A]

ans = list(sorted(list(set(candidate1+candidate2))))
ans = [str(ans[i]) for i in range(len(candidate2) + len(candidate1))]

print('\n'.join(ans))

Fixed code:
A, B, K = map(int, input().split())
candidate1 = [i for i in range(A, A+K) if i <= B]
candidate2 = [i+1 for i in range(B-K, B) if i+1 >= A]

ans = list(sorted(list(set(candidate1+candidate2))))
ans = [str(ans[i]) for i in range(len(ans))]

print('\n'.join(ans))
Buggy code:
A,B,K= list(map(int,input().split()))

AK = A+K-1
BK = B-K+1
for i in range(A,AK+1):
  if i >= A and i <= AK:
    print(i)
for i in range(BK,B+1): 
  if (i >= A and i <= AK)!=1:
    if i >= BK and i <= B:
      print(i)

Fixed code:
A,B,K= list(map(int,input().split()))

AK = A+K-1
BK = B-K+1
for i in range(A,A+K):
  if i <= B:
    if i >= A and i <= AK:
      print(i)
for i in range(BK,B+1): 
  if (i <= AK)!=1:
    if i >= BK and i <= B:
      print(i)
Buggy code:
A, B, K = map(int, input().split())

first = [i for i in range(A, B+1)] if A + K >= B else [i for i in range(A, A+K)]
latter = [i for i in range(B-K, B+1)] if B - K >= A else [i for i in range(A, B+1)]

for i in set(first + latter):
    print(i)


Fixed code:
A, B, K = map(int, input().split())

first = [i for i in range(A, B+1)] if A + K >= B else [i for i in range(A, A+K)]
latter = [i for i in range(B-K+1, B+1)] if B - K >= A else [i for i in range(A, B+1)]

for i in sorted(list(set(first + latter))):
    print(i)
Buggy code:
temp = input()
a,b,k = temp.split()
a = int(a)
b = int(b)
k = int(k)

box = []
for i in range(k):
    box.append(a+i)
    box.append(b-i)
out = set(box)
out = list(out)
out = [i for i in out if i>=a and i<=b]
sorted(out)
for i in out:
    print(i)


Fixed code:
temp = input()
a,b,k = temp.split()
a = int(a)
b = int(b)
k = int(k)

box = []
for i in range(k):
    box.append(a+i)
    box.append(b-i)
out = set(box)
out = list(out)
out = [i for i in out if i>=a and i<=b]
out = sorted(out)
for i in out:
    print(i)
Buggy code:
A, B, K = map(int, input().split())

B += 1
K = min(B-A, K)

ans_F = [x for x in range(A, A+K)]
ans_B = [x for x in range(B-K, B)]

print(sorted(set(ans_F)|set(ans_B)))

Fixed code:
A, B, K = map(int, input().split())

B += 1
K = min(B-A, K)

ans_F = [x for x in range(A, A+K)]
ans_B = [x for x in range(B-K, B)]

ans = sorted(set(ans_F)|set(ans_B))

for i in ans:
    print(i)
Buggy code:
a=input().split(' ')
A=int(a[0])
B=int(a[1])
K=int(a[2])
if B-A+1<=K/2:
  for i in range(A,B+1):
    print(i)
else:
  for i in range(K):
    print(A+i)
  for i in range(K):
    print(B-K+1+i)
  

Fixed code:
a=input().split(' ')
A=int(a[0])
B=int(a[1])
K=int(a[2])
if B-A+1<=K*2:
  for i in range(A,B+1):
    print(i)
else:
  for i in range(K):
    print(A+i)
  for i in range(K):
    print(B-K+1+i)