diff --git "a/test.list.csv" "b/test.list.csv"
new file mode 100644--- /dev/null
+++ "b/test.list.csv"
@@ -0,0 +1,3783 @@
+,description,input,output,types
+0,slice-k-n with k=1 and n=5,"([2, 12, 15, 7, 10, 4, 14, 11, 7],)","[2, 12, 15, 7, 10]",list(int) -> list(int)
+1,replace-all-with-index-k with k=3,"([14, 0, 6, 5, 14, 1, 2, 5, 3],)","[6, 6, 6, 6, 6, 6, 6, 6, 6]",list(int) -> list(int)
+2,index-k with k=3,"([12, 14, 15, 4, 8, 1, 0, 10, 8, 0],)",15,list(int) -> int
+3,keep eq 2,"([2, 0, 4, 5, 2],)","[2, 2]",list(int) -> list(int)
+4,bool-identify-k with k=1,"([1, 2, 9, 16],)","[True, False, False, False]",list(int) -> list(bool)
+5,mult-k with k=5,"([12, 2, 8, 5],)","[60, 10, 40, 25]",list(int) -> list(int)
+6,prepend-k with k=3,"([13, 8, 9, 4, 0],)","[3, 13, 8, 9, 4, 0]",list(int) -> list(int)
+7,take-k with k=1,"([4, 3, 14],)",[4],list(int) -> list(int)
+8,bool-identify-geq-k with k=4,"([4],)",[True],list(int) -> list(bool)
+9,append-index-k with k=3,"([9, 5, 2, 15, 8, 1],)","[9, 5, 2, 15, 8, 1, 2]",list(int) -> list(int)
+10,slice-k-n with k=1 and n=5,"([7, 4, 1, 16, 9, 16, 14, 6, 15, 2, 9, 1],)","[7, 4, 1, 16, 9]",list(int) -> list(int)
+11,append-k with k=4,"([13],)","[13, 4]",list(int) -> list(int)
+12,slice-k-n with k=3 and n=3,"([9, 5, 7, 11, 0, 7, 16],)","[7, 11, 0]",list(int) -> list(int)
+13,rotate-k with k=2,"([2, 12, 6, 9],)","[6, 9, 2, 12]",list(int) -> list(int)
+14,append-index-k with k=1,"([12, 7, 2, 2, 9, 11, 14],)","[12, 7, 2, 2, 9, 11, 14, 12]",list(int) -> list(int)
+15,has-head-in-tail,"([6, 6, 16, 6, 2],)",True,list(int) -> bool
+16,keep gt 2,"([3, 3, 5, 5, 3],)","[3, 3, 5, 5, 3]",list(int) -> list(int)
+17,keep gt 3,"([5, 4, 2, 0, 1],)","[5, 4]",list(int) -> list(int)
+18,is-mod-k with k=5,"([65, 35, 5, 35, 5, 80],)",True,list(int) -> bool
+19,remove-mod-head,"([3, 1, 3, 4, 7, 6, 9, 2],)","[1, 4, 7, 2]",list(int) -> list(int)
+20,bool-identify-geq-k with k=2,"([9, 13, 10, 11, 11],)","[True, True, True, True, True]",list(int) -> list(bool)
+21,has-k with k=1,"([6, 14, 4],)",False,list(int) -> bool
+22,remove eq 1,"([1, 2, 5, 0, 4],)","[2, 5, 0, 4]",list(int) -> list(int)
+23,bool-identify-is-prime,"([3, 6],)","[True, False]",list(int) -> list(bool)
+24,prepend-index-k with k=5,"([6, 15, 14, 11, 13, 15, 13, 11, 9],)","[13, 6, 15, 14, 11, 13, 15, 13, 11, 9]",list(int) -> list(int)
+25,bool-identify-is-mod-k with k=1,"([12, 3, 14],)","[True, True, True]",list(int) -> list(bool)
+26,slice-k-n with k=3 and n=3,"([15, 5, 13, 13, 16, 11, 3, 7],)","[13, 13, 16]",list(int) -> list(int)
+27,keep gt 1,"([3, 6, 4, 1, 6],)","[3, 6, 4, 6]",list(int) -> list(int)
+28,kth-largest with k=1,"([3, 15, 1],)",15,list(int) -> int
+29,sum,"([14, 6],)",20,list(int) -> int
+30,has-k with k=0,"([9, 12],)",False,list(int) -> bool
+31,max,"([1, 1, 2, 1],)",2,list(int) -> int
+32,reverse,"([],)",[],list(int) -> list(int)
+33,sort,"([15],)",[15],list(int) -> list(int)
+34,slice-k-n with k=4 and n=1,"([16, 10, 10, 2, 9, 6, 10, 4, 1, 7, 14, 8],)",[2],list(int) -> list(int)
+35,slice-k-n with k=4 and n=5,"([12, 11, 15, 8, 8, 10, 5, 5, 5, 14, 16],)","[8, 8, 10, 5, 5]",list(int) -> list(int)
+36,keep-mod-k with k=3,"([8, 12, 6, 12],)","[12, 6, 12]",list(int) -> list(int)
+37,keep gt 0,"([3, 3, 2, 4, 0],)","[3, 3, 2, 4]",list(int) -> list(int)
+38,mult-k with k=2,"([9, 13, 13, 15, 3, 6, 1],)","[18, 26, 26, 30, 6, 12, 2]",list(int) -> list(int)
+39,modulo-k with k=1,"([14, 14, 14, 0, 7, 3],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+40,has-k with k=5,"([12, 3, 14],)",False,list(int) -> bool
+41,empty,"([4],)",False,list(int) -> bool
+42,bool-identify-geq-k with k=4,"([3],)",[False],list(int) -> list(bool)
+43,modulo-k with k=1,"([15, 9, 8, 8, 4, 3],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+44,remove-index-k with k=1,"([8, 10, 12, 11, 8, 8],)","[10, 12, 11, 8, 8]",list(int) -> list(int)
+45,replace-all-with-index-k with k=5,"([9, 12, 12, 15, 13, 16, 5, 13],)","[13, 13, 13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+46,max,"([4, 12],)",12,list(int) -> int
+47,keep gt 0,"([4, 0, 3, 0, 2],)","[4, 3, 2]",list(int) -> list(int)
+48,slice-k-n with k=2 and n=5,"([15, 5, 3, 3, 12, 2, 11, 16, 6, 6, 12, 9, 13, 15, 0],)","[5, 3, 3, 12, 2]",list(int) -> list(int)
+49,count-k with k=5,"([5, 5, 2, 5, 5, 5],)",5,list(int) -> int
+50,slice-k-n with k=5 and n=2,"([15, 10, 14, 9, 4, 7, 1, 7, 1, 1, 5, 8],)","[4, 7]",list(int) -> list(int)
+51,caesar-cipher-k-modulo-n with k=1 and n=3,"([2, 2, 1, 1, 2, 1, 0],)","[0, 0, 2, 2, 0, 2, 1]",list(int) -> list(int)
+52,bool-identify-k with k=0,"([10, 15],)","[False, False]",list(int) -> list(bool)
+53,prepend-index-k with k=4,"([16, 13, 9, 8, 8, 0, 2, 15, 9],)","[8, 16, 13, 9, 8, 8, 0, 2, 15, 9]",list(int) -> list(int)
+54,bool-identify-geq-k with k=1,"([12, 5, 7, 7, 2],)","[True, True, True, True, True]",list(int) -> list(bool)
+55,is-evens,"([28],)",True,list(int) -> bool
+56,add-k with k=3,"([],)",[],list(int) -> list(int)
+57,add-k with k=4,"([4, 7, 15, 3, 2],)","[8, 11, 19, 7, 6]",list(int) -> list(int)
+58,keep eq 0,"([6, 0, 0, 2, 5],)","[0, 0]",list(int) -> list(int)
+59,index-k with k=4,"([4, 6, 12, 8],)",8,list(int) -> int
+60,kth-smallest with k=1,"([3, 14],)",3,list(int) -> int
+61,mult-k with k=2,"([4, 16, 1, 8, 4, 7],)","[8, 32, 2, 16, 8, 14]",list(int) -> list(int)
+62,count-k with k=1,"([],)",0,list(int) -> int
+63,pow-k with k=5,"([4, 4, 12, 7, 13, 9],)","[1024, 1024, 248832, 16807, 371293, 59049]",list(int) -> list(int)
+64,bool-identify-geq-k with k=2,"([9, 0, 4, 3, 1, 10, 0],)","[True, False, True, True, False, True, False]",list(int) -> list(bool)
+65,slice-k-n with k=4 and n=5,"([8, 4, 13, 6, 7, 13, 7, 5, 15, 11, 8, 13, 6, 1, 0],)","[6, 7, 13, 7, 5]",list(int) -> list(int)
+66,count-k with k=4,"([4, 4, 4, 12],)",3,list(int) -> int
+67,product,"([1, 2, 3],)",6,list(int) -> int
+68,keep-mod-k with k=4,"([4, 12, 3, 15, 5, 5],)","[4, 12]",list(int) -> list(int)
+69,keep-mod-k with k=5,"([5, 9],)",[5],list(int) -> list(int)
+70,repeat,"([4, 3],)","[3, 3, 3, 3]",list(int) -> list(int)
+71,slice-k-n with k=3 and n=3,"([16, 16, 12, 7, 5, 4, 15, 1, 11, 1],)","[12, 7, 5]",list(int) -> list(int)
+72,remove gt 2,"([6, 3, 1, 6, 6],)",[1],list(int) -> list(int)
+73,caesar-cipher-k-modulo-n with k=4 and n=3,"([0, 0],)","[1, 1]",list(int) -> list(int)
+74,remove eq 1,"([4, 4, 0, 3, 2],)","[4, 4, 0, 3, 2]",list(int) -> list(int)
+75,prepend-index-k with k=4,"([5, 4, 14, 5, 13, 5, 9, 9, 15, 13],)","[5, 5, 4, 14, 5, 13, 5, 9, 9, 15, 13]",list(int) -> list(int)
+76,rotate-k with k=2,"([16, 2, 16, 6, 8, 12, 12, 3, 6, 8, 5, 5],)","[5, 5, 16, 2, 16, 6, 8, 12, 12, 3, 6, 8]",list(int) -> list(int)
+77,keep-mod-k with k=3,"([],)",[],list(int) -> list(int)
+78,kth-largest with k=3,"([3, 9, 1, 7, 12, 5, 12, 4, 14, 12],)",12,list(int) -> int
+79,modulo-k with k=4,"([15, 4, 8, 1, 0, 10],)","[3, 0, 0, 1, 0, 2]",list(int) -> list(int)
+80,append-index-k with k=5,"([9, 11, 8, 0, 7, 8],)","[9, 11, 8, 0, 7, 8, 7]",list(int) -> list(int)
+81,index-k with k=2,"([1, 11],)",11,list(int) -> int
+82,remove-index-k with k=1,"([13],)",[],list(int) -> list(int)
+83,bool-identify-is-mod-k with k=3,"([1, 6],)","[False, True]",list(int) -> list(bool)
+84,slice-k-n with k=1 and n=2,"([12, 14, 1, 6, 5, 13, 3, 13, 11, 15],)","[12, 14]",list(int) -> list(int)
+85,append-k with k=3,"([6, 7, 9, 14],)","[6, 7, 9, 14, 3]",list(int) -> list(int)
+86,prepend-k with k=4,"([6, 5, 3, 16, 7, 16, 5],)","[4, 6, 5, 3, 16, 7, 16, 5]",list(int) -> list(int)
+87,append-k with k=0,"([2, 2, 9],)","[2, 2, 9, 0]",list(int) -> list(int)
+88,append-k with k=1,"([0, 12, 5, 16, 2, 5, 12],)","[0, 12, 5, 16, 2, 5, 12, 1]",list(int) -> list(int)
+89,caesar-cipher-k-modulo-n with k=2 and n=4,"([0, 3, 3],)","[2, 1, 1]",list(int) -> list(int)
+90,mult-k with k=3,"([10, 0, 1, 2, 6, 4],)","[30, 0, 3, 6, 18, 12]",list(int) -> list(int)
+91,append-k with k=4,"([11, 14, 14, 0, 5, 10],)","[11, 14, 14, 0, 5, 10, 4]",list(int) -> list(int)
+92,slice-k-n with k=1 and n=4,"([15, 10, 11, 14, 12, 12, 14],)","[15, 10, 11, 14]",list(int) -> list(int)
+93,remove-mod-k with k=5,"([0, 5],)",[],list(int) -> list(int)
+94,reverse,"([],)",[],list(int) -> list(int)
+95,count-k with k=0,"([9, 7, 2, 6],)",0,list(int) -> int
+96,slice-k-n with k=3 and n=5,"([5, 11, 10, 6, 5, 14, 1, 2, 4, 1, 2, 5, 6, 15],)","[10, 6, 5, 14, 1]",list(int) -> list(int)
+97,keep eq 2,"([3, 6, 1, 0, 5],)",[],list(int) -> list(int)
+98,count-k with k=5,"([0, 1, 2, 14, 3, 9, 12],)",0,list(int) -> int
+99,is-mod-k with k=2,"([12, 16, 28, 16, 4, 2],)",True,list(int) -> bool
+100,has-k with k=4,"([16, 14, 7, 8, 7, 1, 3],)",False,list(int) -> bool
+101,modulo-k with k=1,"([7, 8, 1, 9],)","[0, 0, 0, 0]",list(int) -> list(int)
+102,bool-identify-k with k=5,"([5, 5, 5, 5, 5],)","[True, True, True, True, True]",list(int) -> list(bool)
+103,keep-mod-k with k=5,"([],)",[],list(int) -> list(int)
+104,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 3, 2, 4, 2],)","[1, 0, 4, 1, 4]",list(int) -> list(int)
+105,remove empty lists,"([[True], [True], [False], [False, False, True]],)","[[True], [True], [False], [False, False, True]]",list(list(bool)) -> list(list(bool))
+106,prepend-k with k=1,"([15, 15, 15, 12, 8, 12],)","[1, 15, 15, 15, 12, 8, 12]",list(int) -> list(int)
+107,replace-all-with-index-k with k=4,"([0, 9, 16, 3, 3, 11, 16, 0],)","[3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+108,append-k with k=5,"([5],)","[5, 5]",list(int) -> list(int)
+109,slice-k-n with k=5 and n=2,"([9, 9, 11, 10, 14, 11, 13, 12, 10, 16],)","[14, 11]",list(int) -> list(int)
+110,bool-identify-k with k=4,"([6, 4, 4, 0],)","[False, True, True, False]",list(int) -> list(bool)
+111,has-k with k=3,"([3, 3, 3, 3],)",True,list(int) -> bool
+112,count-k with k=5,"([5, 0],)",1,list(int) -> int
+113,kth-largest with k=1,"([6, 4, 15, 0],)",15,list(int) -> int
+114,slice-k-n with k=5 and n=4,"([11, 15, 13, 3, 10, 16, 13, 3, 11, 5, 15, 6, 6, 14, 6, 10, 9],)","[10, 16, 13, 3]",list(int) -> list(int)
+115,has-k with k=5,"([11, 0, 5, 5, 5, 5, 5],)",True,list(int) -> bool
+116,append-index-k with k=3,"([3, 13, 5, 7, 4, 3, 3],)","[3, 13, 5, 7, 4, 3, 3, 5]",list(int) -> list(int)
+117,keep-mod-k with k=2,"([6, 8, 6, 14, 11, 4, 15],)","[6, 8, 6, 14, 4]",list(int) -> list(int)
+118,remove gt 2,"([1, 5, 5, 6, 3],)",[1],list(int) -> list(int)
+119,kth-smallest with k=3,"([16, 16, 4, 0, 3, 4, 9],)",4,list(int) -> int
+120,slice-k-n with k=2 and n=1,"([3, 0, 3, 0, 11, 2, 1, 0, 8, 1, 15],)",[0],list(int) -> list(int)
+121,take-k with k=1,"([15, 0, 4, 1],)",[15],list(int) -> list(int)
+122,bool-identify-geq-k with k=0,"([10, 15, 5, 16, 9, 7, 9],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+123,repeat-many,"([1, 0, 1],)","[0, 1]",list(int) -> list(int)
+124,slice-k-n with k=1 and n=3,"([15, 14, 7, 2, 13, 14, 7],)","[15, 14, 7]",list(int) -> list(int)
+125,modulo-k with k=1,"([1, 16, 5, 15, 8, 10, 13],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+126,remove-mod-k with k=4,"([10, 3, 5, 8, 3, 7],)","[10, 3, 5, 3, 7]",list(int) -> list(int)
+127,bool-identify-geq-k with k=1,"([1, 2, 15, 11, 14, 1],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+128,slice-k-n with k=2 and n=3,"([2, 15, 1, 6, 7, 10, 1, 8, 8, 7, 8],)","[15, 1, 6]",list(int) -> list(int)
+129,repeat-k with k=2,"([4, 11, 11, 12],)","[4, 11, 11, 12, 4, 11, 11, 12]",list(int) -> list(int)
+130,take-k with k=4,"([1, 11, 15, 7, 12],)","[1, 11, 15, 7]",list(int) -> list(int)
+131,replace-all-with-index-k with k=3,"([2, 14, 16, 10, 9, 6],)","[16, 16, 16, 16, 16, 16]",list(int) -> list(int)
+132,remove-index-k with k=1,"([6, 0],)",[0],list(int) -> list(int)
+133,append-k with k=1,"([13, 11, 5, 1],)","[13, 11, 5, 1, 1]",list(int) -> list(int)
+134,keep eq 3,"([6, 6, 0, 6, 6],)",[],list(int) -> list(int)
+135,slice-k-n with k=4 and n=5,"([6, 5, 16, 5, 5, 12, 12, 9, 9, 16, 14, 14],)","[5, 5, 12, 12, 9]",list(int) -> list(int)
+136,index-k with k=5,"([9, 1, 6, 0, 4, 14, 15, 6, 6, 14, 4, 7],)",4,list(int) -> int
+137,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 1, 2],)","[3, 2, 3]",list(int) -> list(int)
+138,has-k with k=5,"([],)",False,list(int) -> bool
+139,bool-identify-k with k=3,"([2, 8, 0, 14, 3, 10],)","[False, False, False, False, True, False]",list(int) -> list(bool)
+140,count-head-in-tail,"([11],)",0,list(int) -> int
+141,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 0, 2, 1, 3, 2],)","[0, 2, 0, 3, 1, 0]",list(int) -> list(int)
+142,replace-all-with-index-k with k=1,"([14, 14],)","[14, 14]",list(int) -> list(int)
+143,add-k with k=3,"([],)",[],list(int) -> list(int)
+144,modulo-k with k=1,"([0, 15, 15, 16, 9],)","[0, 0, 0, 0, 0]",list(int) -> list(int)
+145,count-k with k=5,"([5, 5, 5, 5, 5],)",5,list(int) -> int
+146,append-k with k=1,"([7],)","[7, 1]",list(int) -> list(int)
+147,slice-k-n with k=4 and n=2,"([0, 14, 0, 16, 0, 12, 0, 2, 7, 8, 5, 9, 10, 2],)","[16, 0]",list(int) -> list(int)
+148,mult-k with k=5,"([16, 15, 1, 15],)","[80, 75, 5, 75]",list(int) -> list(int)
+149,keep eq 3,"([4, 6, 6, 6, 3],)",[3],list(int) -> list(int)
+150,remove gt 2,"([6, 3, 1, 5, 2],)","[1, 2]",list(int) -> list(int)
+151,slice-k-n with k=1 and n=2,"([13, 13, 8, 0, 5, 14, 0, 2],)","[13, 13]",list(int) -> list(int)
+152,keep eq 1,"([6, 2, 1, 5, 0],)",[1],list(int) -> list(int)
+153,kth-largest with k=4,"([4, 8, 4, 5],)",4,list(int) -> int
+154,keep eq 3,"([0, 1, 6, 2, 0],)",[],list(int) -> list(int)
+155,slice-k-n with k=4 and n=2,"([8, 2, 9, 6, 5, 9, 12, 11, 11, 6],)","[6, 5]",list(int) -> list(int)
+156,append-index-k with k=2,"([5, 1, 1, 13, 5, 0, 1],)","[5, 1, 1, 13, 5, 0, 1, 1]",list(int) -> list(int)
+157,remove-mod-k with k=4,"([0, 24, 16, 24],)",[],list(int) -> list(int)
+158,rotate-k with k=1,"([14, 1],)","[1, 14]",list(int) -> list(int)
+159,remove eq 3,"([1, 2, 1, 4, 6],)","[1, 2, 1, 4, 6]",list(int) -> list(int)
+160,slice-k-n with k=5 and n=3,"([14, 0, 6, 15, 5, 11, 9, 3, 7, 10],)","[5, 11, 9]",list(int) -> list(int)
+161,bool-identify-geq-k with k=2,"([12],)",[True],list(int) -> list(bool)
+162,prepend-k with k=5,"([14, 1, 4, 13, 1, 11, 12],)","[5, 14, 1, 4, 13, 1, 11, 12]",list(int) -> list(int)
+163,slice-k-n with k=4 and n=4,"([12, 8, 6, 4, 5, 10, 8, 11, 9, 9, 16],)","[4, 5, 10, 8]",list(int) -> list(int)
+164,modulo-k with k=4,"([14, 4, 12, 13],)","[2, 0, 0, 1]",list(int) -> list(int)
+165,slice-k-n with k=2 and n=2,"([8, 3, 9, 11, 15, 7, 13, 4],)","[3, 9]",list(int) -> list(int)
+166,slice-k-n with k=2 and n=5,"([10, 14, 14, 0, 16, 0, 9, 15, 1, 15, 10],)","[14, 14, 0, 16, 0]",list(int) -> list(int)
+167,index-head,"([1, 2, 3],)",2,list(int) -> int
+168,prepend-index-k with k=3,"([6, 10, 15, 8, 14, 3, 4, 16, 1],)","[15, 6, 10, 15, 8, 14, 3, 4, 16, 1]",list(int) -> list(int)
+169,slice-k-n with k=1 and n=5,"([15, 6, 12, 11, 12, 12, 2],)","[15, 6, 12, 11, 12]",list(int) -> list(int)
+170,slice-k-n with k=3 and n=3,"([16, 10, 5, 13, 10, 7, 5],)","[5, 13, 10]",list(int) -> list(int)
+171,modulo-k with k=5,"([2, 6, 12],)","[2, 1, 2]",list(int) -> list(int)
+172,take-k with k=2,"([7, 4, 4, 16],)","[7, 4]",list(int) -> list(int)
+173,remove gt 1,"([2, 5, 3, 5, 4],)",[],list(int) -> list(int)
+174,modulo-k with k=5,"([],)",[],list(int) -> list(int)
+175,take-k with k=2,"([7, 6],)","[7, 6]",list(int) -> list(int)
+176,keep eq 0,"([0, 5, 1, 0, 0],)","[0, 0, 0]",list(int) -> list(int)
+177,mult-k with k=5,"([8],)",[40],list(int) -> list(int)
+178,drop-k with k=2,"([15, 13, 0, 15, 8, 9, 16, 7, 6],)","[0, 15, 8, 9, 16, 7, 6]",list(int) -> list(int)
+179,keep-mod-head,"([5, 15, 0, 20, 13, 7],)","[15, 0, 20]",list(int) -> list(int)
+180,take-k with k=4,"([3, 9, 9, 10, 3, 3],)","[3, 9, 9, 10]",list(int) -> list(int)
+181,kth-largest with k=2,"([12, 5, 7, 15, 6],)",12,list(int) -> int
+182,take-k with k=3,"([11, 2, 16, 13, 6, 16, 8, 2, 11, 8],)","[11, 2, 16]",list(int) -> list(int)
+183,prepend-k with k=3,"([7],)","[3, 7]",list(int) -> list(int)
+184,drop-k with k=2,"([15, 11, 4, 15, 14, 16, 2],)","[4, 15, 14, 16, 2]",list(int) -> list(int)
+185,bool-identify-k with k=3,"([],)",[],list(int) -> list(bool)
+186,keep eq 2,"([4, 2, 2, 2, 2],)","[2, 2, 2, 2]",list(int) -> list(int)
+187,kth-largest with k=2,"([10, 5, 5],)",5,list(int) -> int
+188,add-k with k=4,"([],)",[],list(int) -> list(int)
+189,len,"([13, 11, 10, 12, 13],)",5,list(int) -> int
+190,has-k with k=0,"([6, 9, 11, 7, 5, 5, 0],)",True,list(int) -> bool
+191,modulo-k with k=2,"([2, 0, 1, 11, 11, 10],)","[0, 0, 1, 1, 1, 0]",list(int) -> list(int)
+192,bool-identify-k with k=2,"([2, 2, 2, 2, 2, 2],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+193,append-k with k=4,"([3],)","[3, 4]",list(int) -> list(int)
+194,product,"([16, 1, 14, 0, 12],)",0,list(int) -> int
+195,take-k with k=3,"([1, 10, 10],)","[1, 10, 10]",list(int) -> list(int)
+196,remove-mod-k with k=2,"([10, 10, 16, 7, 2],)",[7],list(int) -> list(int)
+197,index-head,"([1, 6, 9, 3, 11, 1],)",6,list(int) -> int
+198,remove-mod-k with k=5,"([20, 10, 5, 7],)",[7],list(int) -> list(int)
+199,pop,"([0, 3, 2, 16],)","[0, 3, 2]",list(int) -> list(int)
+200,slice-k-n with k=1 and n=2,"([6, 8, 7, 10, 2, 5, 3, 0, 15, 16, 3],)","[6, 8]",list(int) -> list(int)
+201,remove gt 0,"([3, 3, 3, 4, 4],)",[],list(int) -> list(int)
+202,drop-k with k=1,"([6, 4, 15, 0],)","[4, 15, 0]",list(int) -> list(int)
+203,range,"(5,)","[0, 1, 2, 3, 4]",int -> list(int)
+204,append-k with k=4,"([],)",[4],list(int) -> list(int)
+205,prepend-k with k=4,"([0, 7, 1, 14],)","[4, 0, 7, 1, 14]",list(int) -> list(int)
+206,kth-smallest with k=4,"([11, 12, 5, 13, 11, 4, 16, 0, 8],)",8,list(int) -> int
+207,modulo-k with k=3,"([9],)",[0],list(int) -> list(int)
+208,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 3, 1],)","[3, 0, 2]",list(int) -> list(int)
+209,kth-smallest with k=5,"([3, 11, 8, 10, 9, 8],)",10,list(int) -> int
+210,mult-k with k=3,"([0, 13, 3, 9, 1],)","[0, 39, 9, 27, 3]",list(int) -> list(int)
+211,keep gt 0,"([1, 2, 0, 5, 2],)","[1, 2, 5, 2]",list(int) -> list(int)
+212,head,"([11, 13, 15, 15, 0, 1, 3],)",11,list(int) -> int
+213,caesar-cipher-k-modulo-n with k=4 and n=3,"([0],)",[1],list(int) -> list(int)
+214,keep-mod-k with k=2,"([13, 9, 11, 13],)",[],list(int) -> list(int)
+215,prepend-index-k with k=4,"([14, 10, 5, 16, 1, 1, 4, 13, 16, 15],)","[16, 14, 10, 5, 16, 1, 1, 4, 13, 16, 15]",list(int) -> list(int)
+216,bool-identify-k with k=0,"([0, 0, 9],)","[True, True, False]",list(int) -> list(bool)
+217,dup,"([5],)","[5, 5]",list(int) -> list(int)
+218,add-k with k=3,"([2, 14, 15],)","[5, 17, 18]",list(int) -> list(int)
+219,remove empty lists,"([[False, False, False], [True, False, True], [], [False]],)","[[False, False, False], [True, False, True], [False]]",list(list(bool)) -> list(list(bool))
+220,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 0, 0, 1],)","[1, 1, 1, 0]",list(int) -> list(int)
+221,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 0, 1, 0, 0, 1, 0],)","[0, 1, 0, 1, 1, 0, 1]",list(int) -> list(int)
+222,append-index-k with k=1,"([4],)","[4, 4]",list(int) -> list(int)
+223,prepend-index-k with k=3,"([13, 16, 6, 9, 16, 6, 10],)","[6, 13, 16, 6, 9, 16, 6, 10]",list(int) -> list(int)
+224,add-k with k=3,"([1, 9, 7, 8],)","[4, 12, 10, 11]",list(int) -> list(int)
+225,len,"([15, 15, 0, 1, 3, 16],)",6,list(int) -> int
+226,slice-k-n with k=5 and n=3,"([10, 10, 5, 2, 1, 11, 8, 9, 6, 10, 6, 11, 11, 4],)","[1, 11, 8]",list(int) -> list(int)
+227,count-k with k=1,"([1, 1, 1, 4, 1, 1],)",5,list(int) -> int
+228,kth-smallest with k=2,"([0, 9, 6, 7, 15],)",6,list(int) -> int
+229,is-mod-k with k=3,"([24, 0, 21],)",True,list(int) -> bool
+230,append-index-k with k=4,"([12, 14, 1, 8, 0, 5, 7, 3],)","[12, 14, 1, 8, 0, 5, 7, 3, 8]",list(int) -> list(int)
+231,repeat-k with k=2,"([11],)","[11, 11]",list(int) -> list(int)
+232,mult-k with k=4,"([14, 6, 10, 2, 7],)","[56, 24, 40, 8, 28]",list(int) -> list(int)
+233,bool-identify-k with k=0,"([0, 7],)","[True, False]",list(int) -> list(bool)
+234,caesar-cipher-k-modulo-n with k=5 and n=4,"([2, 0, 1, 1],)","[3, 1, 2, 2]",list(int) -> list(int)
+235,index-head,"([2, 1, 2],)",2,list(int) -> int
+236,prepend-k with k=4,"([13, 1, 11, 16, 7],)","[4, 13, 1, 11, 16, 7]",list(int) -> list(int)
+237,repeat,"([2, 3],)","[3, 3]",list(int) -> list(int)
+238,remove-mod-head,"([10, 8, 7],)","[8, 7]",list(int) -> list(int)
+239,repeat-k with k=3,"([7, 10, 5, 13, 1],)","[7, 10, 5, 13, 1, 7, 10, 5, 13, 1, 7, 10, 5, 13, 1]",list(int) -> list(int)
+240,bool-identify-k with k=5,"([0, 1, 2, 14, 3, 9, 12],)","[False, False, False, False, False, False, False]",list(int) -> list(bool)
+241,last,"([0],)",0,list(int) -> int
+242,drop-k with k=5,"([15, 16, 16, 16, 6, 0, 4, 7],)","[0, 4, 7]",list(int) -> list(int)
+243,take-k with k=2,"([5, 2, 13, 4, 15, 6, 14, 8],)","[5, 2]",list(int) -> list(int)
+244,slice-k-n with k=4 and n=3,"([8, 15, 12, 16, 13, 5, 6, 2],)","[16, 13, 5]",list(int) -> list(int)
+245,slice-k-n with k=3 and n=2,"([8, 8, 8, 15, 15, 16],)","[8, 15]",list(int) -> list(int)
+246,bool-identify-geq-k with k=3,"([7, 11, 2, 3, 2, 2, 10],)","[True, True, False, True, False, False, True]",list(int) -> list(bool)
+247,drop-k with k=4,"([12, 10, 12, 0, 2, 10, 9, 6],)","[2, 10, 9, 6]",list(int) -> list(int)
+248,keep-mod-head,"([3, 24, 3, 9, 12],)","[24, 3, 9, 12]",list(int) -> list(int)
+249,rotate-k with k=1,"([0, 12],)","[12, 0]",list(int) -> list(int)
+250,caesar-cipher-k-modulo-n with k=4 and n=5,"([2, 1, 2, 4],)","[1, 0, 1, 3]",list(int) -> list(int)
+251,slice-k-n with k=4 and n=4,"([6, 7, 15, 4, 8, 9, 13, 1, 7, 6, 1, 2, 7, 10, 14, 8],)","[4, 8, 9, 13]",list(int) -> list(int)
+252,append-k with k=3,"([5, 13, 8, 15, 13, 7, 2],)","[5, 13, 8, 15, 13, 7, 2, 3]",list(int) -> list(int)
+253,mult-k with k=0,"([],)",[],list(int) -> list(int)
+254,modulo-k with k=3,"([12, 11, 8, 8],)","[0, 2, 2, 2]",list(int) -> list(int)
+255,add-k with k=5,"([13, 8, 10],)","[18, 13, 15]",list(int) -> list(int)
+256,append-index-k with k=2,"([4, 11, 8, 4, 10, 11, 4],)","[4, 11, 8, 4, 10, 11, 4, 11]",list(int) -> list(int)
+257,keep gt 0,"([2, 2, 3, 5, 5],)","[2, 2, 3, 5, 5]",list(int) -> list(int)
+258,add-k with k=4,"([11, 11, 1, 7, 3, 2],)","[15, 15, 5, 11, 7, 6]",list(int) -> list(int)
+259,append-k with k=1,"([15, 5, 12, 2, 8],)","[15, 5, 12, 2, 8, 1]",list(int) -> list(int)
+260,remove-mod-k with k=2,"([10, 11, 7],)","[11, 7]",list(int) -> list(int)
+261,count-head-in-tail,"([2, 1, 2],)",1,list(int) -> int
+262,has-k with k=2,"([5, 8, 4, 13, 12],)",False,list(int) -> bool
+263,len,"([1, 2, 3],)",3,list(int) -> int
+264,caesar-cipher-k-modulo-n with k=5 and n=3,"([2, 2, 1, 0, 0],)","[1, 1, 0, 2, 2]",list(int) -> list(int)
+265,slice-k-n with k=5 and n=4,"([12, 4, 14, 10, 8, 12, 12, 9, 1, 0, 4, 0, 15, 13, 1, 11],)","[8, 12, 12, 9]",list(int) -> list(int)
+266,kth-smallest with k=2,"([7, 4, 0, 1, 11, 0, 11],)",0,list(int) -> int
+267,remove eq 2,"([0, 0, 6, 4, 1],)","[0, 0, 6, 4, 1]",list(int) -> list(int)
+268,slice-k-n with k=5 and n=3,"([8, 6, 6, 11, 8, 5, 11, 3, 16, 6, 14, 15, 5, 2, 15],)","[8, 5, 11]",list(int) -> list(int)
+269,add-k with k=4,"([0, 3, 8, 15, 3, 3, 0],)","[4, 7, 12, 19, 7, 7, 4]",list(int) -> list(int)
+270,is-evens,"([5, 7, 14, 0, 13, 5, 9],)",False,list(int) -> bool
+271,drop-k with k=3,"([11, 12, 13, 4, 0, 13, 6, 9, 1, 9],)","[4, 0, 13, 6, 9, 1, 9]",list(int) -> list(int)
+272,remove-index-k with k=1,"([12, 14, 15, 4, 8, 1, 0, 10],)","[14, 15, 4, 8, 1, 0, 10]",list(int) -> list(int)
+273,rotate-k with k=3,"([6, 7, 6, 12, 4, 8, 16, 4, 8, 15, 5, 8, 12, 7, 9],)","[12, 7, 9, 6, 7, 6, 12, 4, 8, 16, 4, 8, 15, 5, 8]",list(int) -> list(int)
+274,remove-mod-head,"([3, 21, 9, 15],)",[],list(int) -> list(int)
+275,count-k with k=0,"([0, 8],)",1,list(int) -> int
+276,append-index-k with k=2,"([1, 7, 8, 8, 1, 5, 15, 6],)","[1, 7, 8, 8, 1, 5, 15, 6, 7]",list(int) -> list(int)
+277,kth-smallest with k=1,"([12, 13],)",12,list(int) -> int
+278,slice-k-n with k=3 and n=2,"([2, 1, 1, 8, 0, 10],)","[1, 8]",list(int) -> list(int)
+279,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 2, 2],)","[1, 4, 4]",list(int) -> list(int)
+280,slice-k-n with k=2 and n=4,"([10, 15, 5, 5, 0, 16, 12, 12, 8, 5, 4, 16],)","[15, 5, 5, 0]",list(int) -> list(int)
+281,count-k with k=5,"([16],)",0,list(int) -> int
+282,drop-k with k=2,"([2, 14, 6, 12],)","[6, 12]",list(int) -> list(int)
+283,prepend-k with k=1,"([16, 3, 3, 9, 11, 6, 0],)","[1, 16, 3, 3, 9, 11, 6, 0]",list(int) -> list(int)
+284,prepend-k with k=3,"([6, 0],)","[3, 6, 0]",list(int) -> list(int)
+285,range +1 maximum list,"([8, 0, 2],)","[0, 1, 2, 3, 4, 5, 6, 7, 8]",list(int) -> list(int)
+286,is-evens,"([2, 5, 4, 2, 0, 5, 1, 1],)",False,list(int) -> bool
+287,remove eq 3,"([4, 4, 2, 2, 6],)","[4, 4, 2, 2, 6]",list(int) -> list(int)
+288,append-k with k=1,"([],)",[1],list(int) -> list(int)
+289,remove-index-k with k=1,"([14, 13, 8, 15, 8, 10, 0, 6],)","[13, 8, 15, 8, 10, 0, 6]",list(int) -> list(int)
+290,count-k with k=3,"([12, 3, 14],)",1,list(int) -> int
+291,slice-k-n with k=4 and n=2,"([3, 7, 8, 0, 7, 6, 8, 6, 9, 8],)","[0, 7]",list(int) -> list(int)
+292,slice-k-n with k=1 and n=3,"([3, 5, 5, 7, 6, 16, 4, 2, 7],)","[3, 5, 5]",list(int) -> list(int)
+293,replace-all-with-index-k with k=2,"([11, 14, 12],)","[14, 14, 14]",list(int) -> list(int)
+294,caesar-cipher-k-modulo-n with k=1 and n=3,"([0],)",[1],list(int) -> list(int)
+295,len,"([2, 7],)",2,list(int) -> int
+296,remove gt 0,"([2, 5, 3, 2, 4],)",[],list(int) -> list(int)
+297,repeat,"([3, 3],)","[3, 3, 3]",list(int) -> list(int)
+298,slice-k-n with k=1 and n=5,"([14, 2, 3, 14, 10, 0, 12, 16, 13],)","[14, 2, 3, 14, 10]",list(int) -> list(int)
+299,kth-smallest with k=2,"([13, 4, 8, 10, 3, 2],)",3,list(int) -> int
+300,reverse,"([7, 13, 5, 7, 6],)","[6, 7, 5, 13, 7]",list(int) -> list(int)
+301,bool-identify-geq-k with k=4,"([2, 0, 1, 15, 2, 4, 0],)","[False, False, False, True, False, True, False]",list(int) -> list(bool)
+302,take-k with k=2,"([15, 0, 14, 12, 16, 15, 1, 14],)","[15, 0]",list(int) -> list(int)
+303,product,"([3, 1, 5, 9, 13],)",1755,list(int) -> int
+304,pow-k with k=5,"([16, 12],)","[1048576, 248832]",list(int) -> list(int)
+305,caesar-cipher-k-modulo-n with k=2 and n=3,"([],)",[],list(int) -> list(int)
+306,index-k with k=3,"([8, 14, 2, 12, 3, 6, 0],)",2,list(int) -> int
+307,slice-k-n with k=2 and n=2,"([2, 13, 7, 10, 15],)","[13, 7]",list(int) -> list(int)
+308,modulo-k with k=5,"([],)",[],list(int) -> list(int)
+309,drop-k with k=2,"([13, 0],)",[],list(int) -> list(int)
+310,repeat-k with k=3,"([10, 9],)","[10, 9, 10, 9, 10, 9]",list(int) -> list(int)
+311,pow-k with k=2,"([15, 15, 0, 1, 3, 16],)","[225, 225, 0, 1, 9, 256]",list(int) -> list(int)
+312,add-k with k=2,"([9, 12, 16, 9],)","[11, 14, 18, 11]",list(int) -> list(int)
+313,remove gt 0,"([6, 5, 0, 6, 1],)",[0],list(int) -> list(int)
+314,remove gt 2,"([5, 0, 1, 6, 6],)","[0, 1]",list(int) -> list(int)
+315,remove-mod-head,"([8, 6, 7, 15, 2],)","[6, 7, 15, 2]",list(int) -> list(int)
+316,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 3, 2, 3, 3, 1],)","[1, 0, 4, 0, 0, 3]",list(int) -> list(int)
+317,keep primes,"([2, 3, 5, 5, 2, 31, 23],)","[2, 3, 5, 5, 2, 31, 23]",list(int) -> list(int)
+318,caesar-cipher-k-modulo-n with k=3 and n=5,"([2, 0, 1, 2, 4, 3],)","[0, 3, 4, 0, 2, 1]",list(int) -> list(int)
+319,append-k with k=0,"([],)",[0],list(int) -> list(int)
+320,keep-mod-head,"([10, 2, 12, 9],)",[],list(int) -> list(int)
+321,append-index-k with k=5,"([11, 9, 15, 7, 2, 3, 11, 7, 1, 2],)","[11, 9, 15, 7, 2, 3, 11, 7, 1, 2, 2]",list(int) -> list(int)
+322,remove-index-k with k=1,"([2, 8, 12],)","[8, 12]",list(int) -> list(int)
+323,append-index-k with k=3,"([0, 13, 12, 12],)","[0, 13, 12, 12, 12]",list(int) -> list(int)
+324,has-k with k=2,"([2, 2, 2, 2, 2],)",True,list(int) -> bool
+325,bool-identify-is-mod-k with k=3,"([3, 3, 7, 3, 14],)","[True, True, False, True, False]",list(int) -> list(bool)
+326,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 0, 1, 1],)","[0, 1, 0, 0]",list(int) -> list(int)
+327,slice-k-n with k=5 and n=5,"([12, 15, 3, 13, 4, 13, 4, 11, 8, 1, 3, 9, 13, 13],)","[4, 13, 4, 11, 8]",list(int) -> list(int)
+328,prepend-k with k=3,"([],)",[3],list(int) -> list(int)
+329,has-k with k=2,"([2, 3, 6, 6, 7, 7],)",True,list(int) -> bool
+330,slice-k-n with k=4 and n=4,"([6, 4, 5, 10, 15, 4, 6, 16, 15, 15, 12],)","[10, 15, 4, 6]",list(int) -> list(int)
+331,remove-mod-k with k=5,"([9, 13, 0, 8],)","[9, 13, 8]",list(int) -> list(int)
+332,append-index-k with k=1,"([13, 14, 9, 10, 15, 3, 9, 15],)","[13, 14, 9, 10, 15, 3, 9, 15, 13]",list(int) -> list(int)
+333,rotate-k with k=4,"([8, 0, 13, 13, 1, 8, 8, 4, 5],)","[8, 8, 4, 5, 8, 0, 13, 13, 1]",list(int) -> list(int)
+334,bool-identify-geq-k with k=1,"([4, 15, 1, 15, 13, 10],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+335,take-k with k=1,"([6, 7, 12, 16],)",[6],list(int) -> list(int)
+336,repeat-k with k=4,"([12, 14, 1],)","[12, 14, 1, 12, 14, 1, 12, 14, 1, 12, 14, 1]",list(int) -> list(int)
+337,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 1, 0, 0],)","[0, 0, 1, 1]",list(int) -> list(int)
+338,keep squares,"([9, 8, 4, 8, 16, 16, 16],)","[9, 4, 16, 16, 16]",list(int) -> list(int)
+339,slice-k-n with k=5 and n=4,"([8, 1, 8, 16, 7, 10, 9, 3, 9, 9, 10, 3, 15, 16, 5, 5],)","[7, 10, 9, 3]",list(int) -> list(int)
+340,index-k with k=4,"([9, 13, 4, 8, 10, 3],)",8,list(int) -> int
+341,tail,"([9, 5, 7, 5, 4, 1],)","[5, 7, 5, 4, 1]",list(int) -> list(int)
+342,prepend-k with k=0,"([14, 0, 3],)","[0, 14, 0, 3]",list(int) -> list(int)
+343,repeat-k with k=2,"([],)",[],list(int) -> list(int)
+344,slice-k-n with k=2 and n=3,"([5, 11, 2, 6, 5, 15, 7, 0, 10, 16],)","[11, 2, 6]",list(int) -> list(int)
+345,pow-k with k=3,"([],)",[],list(int) -> list(int)
+346,keep gt 0,"([5, 4, 1, 5, 1],)","[5, 4, 1, 5, 1]",list(int) -> list(int)
+347,+1 maximum list,"([3, 5, 0],)",6,list(int) -> int
+348,slice-k-n with k=5 and n=3,"([13, 7, 0, 10, 10, 10, 15, 11, 14, 4, 16, 5],)","[10, 10, 15]",list(int) -> list(int)
+349,slice-k-n with k=2 and n=5,"([14, 6, 8, 15, 15, 14, 12, 3],)","[6, 8, 15, 15, 14]",list(int) -> list(int)
+350,keep gt 3,"([6, 1, 1, 3, 1],)",[6],list(int) -> list(int)
+351,prepend-index-k with k=3,"([15, 12, 9, 14, 7, 9],)","[9, 15, 12, 9, 14, 7, 9]",list(int) -> list(int)
+352,slice-k-n with k=3 and n=3,"([7, 13, 9, 7, 8, 15, 9, 15, 7, 4, 9],)","[9, 7, 8]",list(int) -> list(int)
+353,is-mod-k with k=4,"([0, 7, 13, 8, 10],)",False,list(int) -> bool
+354,rotate-k with k=4,"([7, 7, 2, 1, 10, 7, 2, 4, 3, 4, 10, 3, 12, 0, 15, 14],)","[12, 0, 15, 14, 7, 7, 2, 1, 10, 7, 2, 4, 3, 4, 10, 3]",list(int) -> list(int)
+355,bool-identify-k with k=5,"([5, 5, 2, 5, 5, 5],)","[True, True, False, True, True, True]",list(int) -> list(bool)
+356,replace-all-with-index-k with k=5,"([12, 3, 6, 14, 5],)","[5, 5, 5, 5, 5]",list(int) -> list(int)
+357,remove-mod-k with k=3,"([4, 15, 1, 6],)","[4, 1]",list(int) -> list(int)
+358,slice-k-n with k=4 and n=4,"([2, 0, 10, 7, 5, 12, 15, 2, 11, 11, 7, 3, 8, 2],)","[7, 5, 12, 15]",list(int) -> list(int)
+359,append-index-k with k=3,"([6, 15, 6, 15, 5, 13],)","[6, 15, 6, 15, 5, 13, 6]",list(int) -> list(int)
+360,bool-identify-is-mod-k with k=2,"([0, 13, 2],)","[True, False, True]",list(int) -> list(bool)
+361,caesar-cipher-k-modulo-n with k=3 and n=4,"([3, 0, 3, 3, 3],)","[2, 3, 2, 2, 2]",list(int) -> list(int)
+362,replace-all-with-index-k with k=1,"([10, 8, 1, 12],)","[10, 10, 10, 10]",list(int) -> list(int)
+363,evens,"([12, 13],)",[12],list(int) -> list(int)
+364,add-k with k=2,"([9, 4, 9, 6],)","[11, 6, 11, 8]",list(int) -> list(int)
+365,rotate-k with k=1,"([10, 5, 9, 13, 4, 8, 10, 3, 2, 12, 9, 0],)","[0, 10, 5, 9, 13, 4, 8, 10, 3, 2, 12, 9]",list(int) -> list(int)
+366,remove eq 2,"([0, 2, 2, 5, 1],)","[0, 5, 1]",list(int) -> list(int)
+367,slice-k-n with k=2 and n=4,"([16, 6, 12, 6, 8, 11, 7, 2, 11, 2, 4, 1],)","[6, 12, 6, 8]",list(int) -> list(int)
+368,slice-k-n with k=1 and n=3,"([15, 12, 15, 9, 8, 3, 14, 3, 0, 0, 14],)","[15, 12, 15]",list(int) -> list(int)
+369,is-evens,"([14, 6, 5],)",False,list(int) -> bool
+370,append-index-k with k=5,"([12, 12, 3, 2, 14, 15, 10, 11, 4, 11, 15, 2],)","[12, 12, 3, 2, 14, 15, 10, 11, 4, 11, 15, 2, 14]",list(int) -> list(int)
+371,bool-identify-is-mod-k with k=5,"([],)",[],list(int) -> list(bool)
+372,repeat-k with k=5,"([1, 3, 9, 11, 15],)","[1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15]",list(int) -> list(int)
+373,len,"([7, 14, 11],)",3,list(int) -> int
+374,remove-mod-k with k=2,"([7, 10],)",[7],list(int) -> list(int)
+375,keep-mod-head,"([12, 3],)",[],list(int) -> list(int)
+376,caesar-cipher-k-modulo-n with k=2 and n=3,"([],)",[],list(int) -> list(int)
+377,slice-k-n with k=2 and n=2,"([11, 7, 5, 13, 0, 4, 14, 8, 3, 10],)","[7, 5]",list(int) -> list(int)
+378,append-k with k=2,"([14, 12, 13, 12, 1],)","[14, 12, 13, 12, 1, 2]",list(int) -> list(int)
+379,slice-k-n with k=3 and n=5,"([5, 0, 14, 1, 3, 6, 0, 6, 16, 3, 2, 14, 8, 7, 8, 16],)","[14, 1, 3, 6, 0]",list(int) -> list(int)
+380,index-k with k=3,"([16, 1, 14],)",14,list(int) -> int
+381,repeat,"([1, 2],)",[2],list(int) -> list(int)
+382,prepend-k with k=1,"([],)",[1],list(int) -> list(int)
+383,replace-all-with-index-k with k=2,"([9, 8],)","[8, 8]",list(int) -> list(int)
+384,kth-largest with k=3,"([11, 12, 13, 4, 0, 13, 6, 9, 1, 9],)",12,list(int) -> int
+385,append-index-k with k=3,"([6, 14, 12, 4, 4, 15, 3, 1, 4],)","[6, 14, 12, 4, 4, 15, 3, 1, 4, 12]",list(int) -> list(int)
+386,slice-k-n with k=5 and n=1,"([13, 2, 13, 7, 6, 6, 14, 5, 15, 5, 16],)",[6],list(int) -> list(int)
+387,prepend-index-k with k=5,"([7, 5, 5, 10, 11, 7, 2, 2, 2, 10, 2, 0],)","[11, 7, 5, 5, 10, 11, 7, 2, 2, 2, 10, 2, 0]",list(int) -> list(int)
+388,remove gt 0,"([4, 3, 4, 1, 3],)",[],list(int) -> list(int)
+389,repeat-k with k=5,"([],)",[],list(int) -> list(int)
+390,modulo-k with k=3,"([12, 4, 8, 11, 0, 8, 11],)","[0, 1, 2, 2, 0, 2, 2]",list(int) -> list(int)
+391,count-k with k=0,"([0, 7],)",1,list(int) -> int
+392,caesar-cipher-k-modulo-n with k=2 and n=3,"([2, 2, 2, 1],)","[1, 1, 1, 0]",list(int) -> list(int)
+393,bool-identify-is-mod-k with k=1,"([1, 1, 1],)","[True, True, True]",list(int) -> list(bool)
+394,append-k with k=2,"([],)",[2],list(int) -> list(int)
+395,slice-k-n with k=1 and n=4,"([5, 6, 8, 1, 11, 12, 12, 6, 5, 6],)","[5, 6, 8, 1]",list(int) -> list(int)
+396,mult-k with k=5,"([3, 9, 12, 12, 4, 12],)","[15, 45, 60, 60, 20, 60]",list(int) -> list(int)
+397,count-head-in-tail,"([2, 3, 4],)",0,list(int) -> int
+398,pop,"([2, 0, 1, 11, 11, 10],)","[2, 0, 1, 11, 11]",list(int) -> list(int)
+399,is-odds,"([12],)",False,list(int) -> bool
+400,pop,"([0],)",[],list(int) -> list(int)
+401,has-k with k=5,"([2, 13],)",False,list(int) -> bool
+402,caesar-cipher-k-modulo-n with k=1 and n=5,"([2, 3, 3],)","[3, 4, 4]",list(int) -> list(int)
+403,caesar-cipher-k-modulo-n with k=3 and n=2,"([0, 0, 0, 0, 1, 1],)","[1, 1, 1, 1, 0, 0]",list(int) -> list(int)
+404,slice-k-n with k=4 and n=2,"([12, 9, 10, 1, 7, 7, 10, 7, 4, 1, 2, 12, 9, 14],)","[1, 7]",list(int) -> list(int)
+405,slice-k-n with k=4 and n=5,"([7, 8, 2, 2, 13, 15, 0, 9, 8, 8, 13, 13, 10, 11, 7],)","[2, 13, 15, 0, 9]",list(int) -> list(int)
+406,kth-largest with k=1,"([16],)",16,list(int) -> int
+407,slice-k-n with k=3 and n=1,"([12, 5, 11, 0, 2, 6, 2, 10, 16],)",[11],list(int) -> list(int)
+408,caesar-cipher-k-modulo-n with k=1 and n=2,"([],)",[],list(int) -> list(int)
+409,remove-mod-k with k=3,"([6],)",[],list(int) -> list(int)
+410,keep-mod-k with k=2,"([10, 8, 16, 5, 9],)","[10, 8, 16]",list(int) -> list(int)
+411,caesar-cipher-k-modulo-n with k=2 and n=3,"([0, 0, 0, 2, 2],)","[2, 2, 2, 1, 1]",list(int) -> list(int)
+412,caesar-cipher-k-modulo-n with k=4 and n=3,"([2, 2, 1, 1, 2, 1, 0],)","[0, 0, 2, 2, 0, 2, 1]",list(int) -> list(int)
+413,odds,"([2, 5, 4, 2, 0, 5, 1, 1],)","[5, 5, 1, 1]",list(int) -> list(int)
+414,is-primes,"([5],)",True,list(int) -> bool
+415,bool-identify-is-mod-k with k=4,"([2, 4],)","[False, True]",list(int) -> list(bool)
+416,index-k with k=1,"([0, 3, 1, 6],)",0,list(int) -> int
+417,keep-mod-k with k=3,"([5, 16, 12],)",[12],list(int) -> list(int)
+418,replace-all-with-index-k with k=4,"([1, 4, 13, 3],)","[3, 3, 3, 3]",list(int) -> list(int)
+419,append-index-k with k=4,"([9, 14, 6, 9, 8, 2, 5, 13, 3, 7],)","[9, 14, 6, 9, 8, 2, 5, 13, 3, 7, 9]",list(int) -> list(int)
+420,add-k with k=1,"([15, 2, 16, 2, 5, 15, 6],)","[16, 3, 17, 3, 6, 16, 7]",list(int) -> list(int)
+421,slice-k-n with k=4 and n=3,"([14, 8, 11, 16, 15, 11, 5, 5, 10, 0, 12, 8, 3, 9],)","[16, 15, 11]",list(int) -> list(int)
+422,append-index-k with k=3,"([15, 0, 13, 10, 7, 1, 14, 5, 10, 10],)","[15, 0, 13, 10, 7, 1, 14, 5, 10, 10, 13]",list(int) -> list(int)
+423,count-k with k=3,"([10, 0, 15, 9, 13],)",0,list(int) -> int
+424,slice-k-n with k=4 and n=4,"([14, 9, 3, 15, 10, 9, 5, 12, 14, 4, 7, 13, 15, 2],)","[15, 10, 9, 5]",list(int) -> list(int)
+425,append-index-k with k=4,"([5, 2, 13, 3, 0, 8],)","[5, 2, 13, 3, 0, 8, 3]",list(int) -> list(int)
+426,is-mod-k with k=5,"([60, 25, 45, 25, 25],)",True,list(int) -> bool
+427,add-k with k=3,"([2, 4, 6, 9, 13],)","[5, 7, 9, 12, 16]",list(int) -> list(int)
+428,remove gt 2,"([4, 3, 0, 1, 3],)","[0, 1]",list(int) -> list(int)
+429,bool-identify-is-mod-k with k=3,"([3, 16, 11, 3],)","[True, False, False, True]",list(int) -> list(bool)
+430,keep-mod-k with k=3,"([],)",[],list(int) -> list(int)
+431,take-k with k=5,"([1, 10, 9, 6, 10, 14, 7, 11, 16, 15],)","[1, 10, 9, 6, 10]",list(int) -> list(int)
+432,remove-index-k with k=3,"([11, 7, 2],)","[11, 7]",list(int) -> list(int)
+433,keep-mod-head,"([1, 2, 3],)","[2, 3]",list(int) -> list(int)
+434,keep gt 0,"([0, 3, 5, 0, 0],)","[3, 5]",list(int) -> list(int)
+435,mult-k with k=0,"([11, 11, 4, 14, 6, 14, 0],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+436,slice-k-n with k=3 and n=4,"([9, 8, 16, 9, 14, 9, 12, 1, 1, 0, 13, 0],)","[16, 9, 14, 9]",list(int) -> list(int)
+437,slice-k-n with k=2 and n=1,"([7, 13, 3, 4, 8, 16, 5, 1],)",[13],list(int) -> list(int)
+438,caesar-cipher-k-modulo-n with k=3 and n=2,"([0, 0, 0, 0, 1, 0, 1],)","[1, 1, 1, 1, 0, 1, 0]",list(int) -> list(int)
+439,reverse,"([2, 0, 4],)","[4, 0, 2]",list(int) -> list(int)
+440,has-k with k=1,"([14, 8, 1, 1, 1, 1],)",True,list(int) -> bool
+441,append-k with k=1,"([9],)","[9, 1]",list(int) -> list(int)
+442,remove eq 3,"([4, 5, 2, 5, 6],)","[4, 5, 2, 5, 6]",list(int) -> list(int)
+443,kth-smallest with k=2,"([7, 2, 5, 9, 11, 13, 2],)",2,list(int) -> int
+444,bool-identify-geq-k with k=1,"([1, 5, 1, 5, 6],)","[True, True, True, True, True]",list(int) -> list(bool)
+445,is-evens,"([4, 13, 12, 8, 14, 1, 7],)",False,list(int) -> bool
+446,modulo-k with k=2,"([5, 16, 10, 16, 8, 7],)","[1, 0, 0, 0, 0, 1]",list(int) -> list(int)
+447,odds,"([6, 10, 15, 8, 14, 3],)","[15, 3]",list(int) -> list(int)
+448,has-k with k=0,"([1, 8],)",False,list(int) -> bool
+449,modulo-k with k=3,"([],)",[],list(int) -> list(int)
+450,slice-k-n with k=2 and n=1,"([16, 1, 14, 11, 16, 4],)",[1],list(int) -> list(int)
+451,prepend-index-k with k=5,"([3, 9, 3, 9, 3, 11],)","[3, 3, 9, 3, 9, 3, 11]",list(int) -> list(int)
+452,repeat-k with k=2,"([9, 5, 0, 0, 13],)","[9, 5, 0, 0, 13, 9, 5, 0, 0, 13]",list(int) -> list(int)
+453,odds,"([],)",[],list(int) -> list(int)
+454,slice-k-n with k=1 and n=1,"([8, 5, 0],)",[8],list(int) -> list(int)
+455,replace-all-with-index-k with k=5,"([2, 4, 9, 8, 7, 9, 16],)","[7, 7, 7, 7, 7, 7, 7]",list(int) -> list(int)
+456,prepend-k with k=4,"([12, 7],)","[4, 12, 7]",list(int) -> list(int)
+457,keep-mod-k with k=4,"([16],)",[16],list(int) -> list(int)
+458,is-mod-k with k=4,"([16, 15, 11, 9, 16],)",False,list(int) -> bool
+459,slice-k-n with k=5 and n=1,"([8, 3, 7, 9, 3, 8, 10, 9],)",[3],list(int) -> list(int)
+460,slice-k-n with k=1 and n=4,"([15, 13, 11, 10, 5, 14, 11, 13, 6, 5],)","[15, 13, 11, 10]",list(int) -> list(int)
+461,index-k with k=5,"([0, 15, 1, 4, 12, 10, 8, 7, 4, 2, 3, 12],)",12,list(int) -> int
+462,take-k with k=3,"([7, 4, 16, 15, 16, 3, 10, 11, 3],)","[7, 4, 16]",list(int) -> list(int)
+463,sort-and-deduplicate,"([3, 7, 5, 4],)","[3, 4, 5, 7]",list(int) -> list(int)
+464,remove gt 3,"([1, 2, 0, 0, 6],)","[1, 2, 0, 0]",list(int) -> list(int)
+465,bool-identify-k with k=4,"([13, 4, 0, 1, 4],)","[False, True, False, False, True]",list(int) -> list(bool)
+466,append-index-k with k=5,"([16, 15, 7, 8, 2, 5, 14, 15, 8, 8],)","[16, 15, 7, 8, 2, 5, 14, 15, 8, 8, 2]",list(int) -> list(int)
+467,remove gt 1,"([5, 0, 1, 6, 0],)","[0, 1, 0]",list(int) -> list(int)
+468,append-index-k with k=5,"([13, 0, 16, 8, 9, 10, 16, 7],)","[13, 0, 16, 8, 9, 10, 16, 7, 9]",list(int) -> list(int)
+469,slice-k-n with k=5 and n=5,"([8, 0, 5, 2, 1, 6, 13, 16, 14, 6, 13, 16, 6],)","[1, 6, 13, 16, 14]",list(int) -> list(int)
+470,slice-k-n with k=5 and n=5,"([13, 11, 2, 2, 14, 5, 13, 9, 10, 2, 11],)","[14, 5, 13, 9, 10]",list(int) -> list(int)
+471,product,"([8, 6, 8, 11, 11, 16],)",743424,list(int) -> int
+472,range,"(3,)","[0, 1, 2]",int -> list(int)
+473,rotate-k with k=2,"([2, 7, 8, 16, 10, 0, 10, 8, 9, 8, 1, 9, 3],)","[9, 3, 2, 7, 8, 16, 10, 0, 10, 8, 9, 8, 1]",list(int) -> list(int)
+474,max,"([13, 10, 9, 16, 4, 15, 13],)",16,list(int) -> int
+475,range,"(2,)","[0, 1]",int -> list(int)
+476,bool-identify-geq-k with k=2,"([1, 3, 4, 1, 13, 9],)","[False, True, True, False, True, True]",list(int) -> list(bool)
+477,remove-index-k with k=1,"([1],)",[],list(int) -> list(int)
+478,range,"(1,)",[0],int -> list(int)
+479,keep-mod-head,"([6, 6, 5, 24, 54, 24],)","[6, 24, 54, 24]",list(int) -> list(int)
+480,index-k with k=3,"([8, 2, 15, 3, 10, 0],)",15,list(int) -> int
+481,sum,"([10],)",10,list(int) -> int
+482,keep-mod-k with k=2,"([10, 0, 16],)","[10, 0, 16]",list(int) -> list(int)
+483,remove-mod-k with k=4,"([28, 6, 20, 16, 5],)","[6, 5]",list(int) -> list(int)
+484,bool-identify-geq-k with k=0,"([10, 6, 8, 4, 6, 6, 7],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+485,pow-k with k=4,"([0, 2, 5, 4, 11, 7],)","[0, 16, 625, 256, 14641, 2401]",list(int) -> list(int)
+486,pop,"([2],)",[],list(int) -> list(int)
+487,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 1, 0],)","[1, 0, 1]",list(int) -> list(int)
+488,add-k with k=5,"([7, 6, 11],)","[12, 11, 16]",list(int) -> list(int)
+489,empty,"([],)",True,list(int) -> bool
+490,slice-k-n with k=3 and n=1,"([5, 9, 2, 16, 15, 0, 5, 10, 3],)",[2],list(int) -> list(int)
+491,mult-k with k=5,"([8, 15, 9, 0, 1],)","[40, 75, 45, 0, 5]",list(int) -> list(int)
+492,slice-k-n with k=2 and n=1,"([2, 6, 5, 5, 2],)",[6],list(int) -> list(int)
+493,kth-largest with k=4,"([14, 4, 4, 13, 12],)",4,list(int) -> int
+494,replace-all-with-index-k with k=4,"([10, 5, 4, 3, 7, 1, 5, 10, 3, 15],)","[3, 3, 3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+495,index-k with k=2,"([10, 10, 6, 8, 1, 3, 0],)",10,list(int) -> int
+496,add-k with k=1,"([9, 6],)","[10, 7]",list(int) -> list(int)
+497,index-k with k=1,"([6, 1, 4, 12, 12, 0],)",6,list(int) -> int
+498,caesar-cipher-k-modulo-n with k=2 and n=5,"([],)",[],list(int) -> list(int)
+499,index-k with k=4,"([5, 11, 2, 10, 13, 9, 13, 16],)",10,list(int) -> int
+500,has-k with k=0,"([3, 8, 9],)",False,list(int) -> bool
+501,slice-k-n with k=5 and n=3,"([14, 15, 15, 9, 3, 7, 7, 6, 8, 1, 1, 7, 9],)","[3, 7, 7]",list(int) -> list(int)
+502,is-primes,"([17, 193, 149, 13, 3, 47],)",True,list(int) -> bool
+503,keep-mod-k with k=2,"([12],)",[12],list(int) -> list(int)
+504,slice-k-n with k=2 and n=1,"([15, 2, 4, 4, 4, 9],)",[2],list(int) -> list(int)
+505,prepend-k with k=2,"([13, 1, 0],)","[2, 13, 1, 0]",list(int) -> list(int)
+506,bool-identify-k with k=1,"([3, 3, 5, 1, 13],)","[False, False, False, True, False]",list(int) -> list(bool)
+507,drop-k with k=1,"([4, 7, 11, 4, 2, 5, 13, 5],)","[7, 11, 4, 2, 5, 13, 5]",list(int) -> list(int)
+508,remove-index-k with k=4,"([12, 9, 10, 2, 3, 5, 1, 8],)","[12, 9, 10, 3, 5, 1, 8]",list(int) -> list(int)
+509,max,"([3],)",3,list(int) -> int
+510,kth-largest with k=2,"([8, 13, 5, 2],)",8,list(int) -> int
+511,remove-index-k with k=5,"([8, 10, 8, 4, 16, 7, 10, 5, 13],)","[8, 10, 8, 4, 7, 10, 5, 13]",list(int) -> list(int)
+512,modulo-k with k=1,"([15, 0, 2, 7, 11, 13],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+513,remove-index-k with k=4,"([8, 7, 4, 2, 3, 12, 8, 13],)","[8, 7, 4, 3, 12, 8, 13]",list(int) -> list(int)
+514,drop-k with k=1,"([0, 1, 2, 7, 16, 3],)","[1, 2, 7, 16, 3]",list(int) -> list(int)
+515,has-k with k=5,"([5, 5, 5, 5, 5, 6, 5],)",True,list(int) -> bool
+516,append-index-k with k=5,"([6, 4, 15, 14, 7, 12, 3, 0, 4, 16],)","[6, 4, 15, 14, 7, 12, 3, 0, 4, 16, 7]",list(int) -> list(int)
+517,prepend-index-k with k=2,"([4, 9, 6, 7, 6, 12, 4, 8],)","[9, 4, 9, 6, 7, 6, 12, 4, 8]",list(int) -> list(int)
+518,prepend-index-k with k=4,"([0, 2, 8, 7, 6, 14, 0, 0, 12],)","[7, 0, 2, 8, 7, 6, 14, 0, 0, 12]",list(int) -> list(int)
+519,slice-k-n with k=1 and n=3,"([8, 1, 7, 13, 11, 2, 5, 16, 10, 9],)","[8, 1, 7]",list(int) -> list(int)
+520,append-k with k=3,"([1],)","[1, 3]",list(int) -> list(int)
+521,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 1, 0, 0, 1],)","[0, 0, 1, 1, 0]",list(int) -> list(int)
+522,drop-k with k=1,"([3, 13],)",[13],list(int) -> list(int)
+523,pow-k with k=3,"([15, 9, 8, 8, 4, 3],)","[3375, 729, 512, 512, 64, 27]",list(int) -> list(int)
+524,keep gt 1,"([0, 4, 0, 3, 1],)","[4, 3]",list(int) -> list(int)
+525,mult-k with k=2,"([8, 5, 16],)","[16, 10, 32]",list(int) -> list(int)
+526,has-head-in-tail,"([2, 3, 4],)",False,list(int) -> bool
+527,kth-smallest with k=2,"([15, 3, 10],)",10,list(int) -> int
+528,keep eq 0,"([2, 4, 5, 2, 6],)",[],list(int) -> list(int)
+529,remove-mod-k with k=2,"([6, 0],)",[],list(int) -> list(int)
+530,slice-k-n with k=2 and n=4,"([7, 6, 9, 1, 2, 13, 16],)","[6, 9, 1, 2]",list(int) -> list(int)
+531,pow-k with k=5,"([6, 8, 2, 2],)","[7776, 32768, 32, 32]",list(int) -> list(int)
+532,modulo-k with k=5,"([11, 2, 16, 6, 4],)","[1, 2, 1, 1, 4]",list(int) -> list(int)
+533,min,"([1, 2, 3],)",1,list(int) -> int
+534,min,"([3, 15, 14, 3, 5, 15],)",3,list(int) -> int
+535,modulo-k with k=3,"([],)",[],list(int) -> list(int)
+536,pop,"([14, 15, 8],)","[14, 15]",list(int) -> list(int)
+537,evens,"([4],)",[4],list(int) -> list(int)
+538,kth-smallest with k=4,"([4, 0, 6, 0],)",6,list(int) -> int
+539,caesar-cipher-k-modulo-n with k=2 and n=5,"([3, 3, 0, 2, 1, 0],)","[0, 0, 2, 4, 3, 2]",list(int) -> list(int)
+540,remove-index-k with k=4,"([4, 14, 15, 6],)","[4, 14, 15]",list(int) -> list(int)
+541,tail,"([13, 0, 4, 12],)","[0, 4, 12]",list(int) -> list(int)
+542,repeat-k with k=5,"([15, 5, 8],)","[15, 5, 8, 15, 5, 8, 15, 5, 8, 15, 5, 8, 15, 5, 8]",list(int) -> list(int)
+543,kth-smallest with k=3,"([6, 4, 16, 5, 11, 11, 14],)",6,list(int) -> int
+544,repeat-k with k=3,"([12, 10],)","[12, 10, 12, 10, 12, 10]",list(int) -> list(int)
+545,kth-largest with k=5,"([10, 1, 4, 3, 5, 6, 0],)",3,list(int) -> int
+546,drop-k with k=3,"([16, 9, 15, 4],)",[4],list(int) -> list(int)
+547,repeat-many,"([1, 1, 2, 3],)","[1, 2, 3]",list(int) -> list(int)
+548,bool-identify-is-mod-k with k=2,"([2, 2, 2, 4, 16],)","[True, True, True, True, True]",list(int) -> list(bool)
+549,append-k with k=5,"([5, 14, 7],)","[5, 14, 7, 5]",list(int) -> list(int)
+550,fibonacci,"(4,)",3,int -> int
+551,keep-mod-k with k=4,"([36, 36, 16],)","[36, 36, 16]",list(int) -> list(int)
+552,keep primes,"([5, 7, 3, 7, 29, 23, 7],)","[5, 7, 3, 7, 29, 23, 7]",list(int) -> list(int)
+553,take-k with k=4,"([12, 2, 6, 8, 3, 14, 12, 7, 16, 16, 5],)","[12, 2, 6, 8]",list(int) -> list(int)
+554,drop-k with k=3,"([4, 1, 11, 2, 3, 15, 2, 0, 12],)","[2, 3, 15, 2, 0, 12]",list(int) -> list(int)
+555,rotate-k with k=2,"([11, 16, 13, 1, 11, 7, 2, 5, 9, 11, 13, 2, 9, 9, 5, 11],)","[5, 11, 11, 16, 13, 1, 11, 7, 2, 5, 9, 11, 13, 2, 9, 9]",list(int) -> list(int)
+556,remove-mod-k with k=4,"([9, 5, 3, 3, 4, 5],)","[9, 5, 3, 3, 5]",list(int) -> list(int)
+557,product,"([10, 6, 8, 4, 6, 6, 7],)",483840,list(int) -> int
+558,bool-identify-is-mod-k with k=5,"([5, 5, 5],)","[True, True, True]",list(int) -> list(bool)
+559,mult-k with k=3,"([1, 2, 7, 5, 4, 0, 13],)","[3, 6, 21, 15, 12, 0, 39]",list(int) -> list(int)
+560,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 1, 0],)","[0, 0, 1]",list(int) -> list(int)
+561,bool-identify-geq-k with k=5,"([4, 8, 10, 0, 15, 8, 4],)","[False, True, True, False, True, True, False]",list(int) -> list(bool)
+562,slice-k-n with k=3 and n=5,"([0, 1, 4, 1, 7, 8, 12, 15, 14, 12, 9, 2, 15, 5],)","[4, 1, 7, 8, 12]",list(int) -> list(int)
+563,caesar-cipher-k-modulo-n with k=2 and n=5,"([1],)",[3],list(int) -> list(int)
+564,remove-index-k with k=3,"([3, 11, 16, 4, 10, 7],)","[3, 11, 4, 10, 7]",list(int) -> list(int)
+565,bool-identify-is-mod-k with k=5,"([5],)",[True],list(int) -> list(bool)
+566,pow-k with k=4,"([9],)",[6561],list(int) -> list(int)
+567,rotate-k with k=3,"([2, 6, 1, 11, 4, 8, 15, 15, 16, 13, 3, 11, 8, 14],)","[11, 8, 14, 2, 6, 1, 11, 4, 8, 15, 15, 16, 13, 3]",list(int) -> list(int)
+568,replace-all-with-index-k with k=1,"([16],)",[16],list(int) -> list(int)
+569,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 2, 1],)","[0, 1, 0]",list(int) -> list(int)
+570,is-odds,"([6, 4, 6, 12, 0, 8, 1],)",False,list(int) -> bool
+571,add-k with k=5,"([10, 8, 4, 7],)","[15, 13, 9, 12]",list(int) -> list(int)
+572,remove-mod-k with k=4,"([20],)",[],list(int) -> list(int)
+573,kth-largest with k=2,"([3, 13, 12],)",12,list(int) -> int
+574,sort,"([],)",[],list(int) -> list(int)
+575,keep-mod-head,"([7, 3, 9],)",[],list(int) -> list(int)
+576,prepend-k with k=3,"([5, 3, 0, 3, 7],)","[3, 5, 3, 0, 3, 7]",list(int) -> list(int)
+577,slice-k-n with k=1 and n=5,"([3, 0, 13, 7, 3, 5, 13, 11, 12, 5, 11],)","[3, 0, 13, 7, 3]",list(int) -> list(int)
+578,prepend-index-k with k=5,"([8, 9, 0, 7, 11],)","[11, 8, 9, 0, 7, 11]",list(int) -> list(int)
+579,slice-k-n with k=5 and n=2,"([2, 15, 5, 13, 14, 10, 2, 2, 15, 16, 1, 13, 15, 4],)","[14, 10]",list(int) -> list(int)
+580,kth-largest with k=5,"([12, 9, 2, 7, 13, 11, 1, 8, 14, 3, 14, 3],)",11,list(int) -> int
+581,slice-k-n with k=2 and n=1,"([9, 0, 16, 9, 10],)",[0],list(int) -> list(int)
+582,max,"([16, 8],)",16,list(int) -> int
+583,repeat-k with k=5,"([7, 9, 9, 2],)","[7, 9, 9, 2, 7, 9, 9, 2, 7, 9, 9, 2, 7, 9, 9, 2, 7, 9, 9, 2]",list(int) -> list(int)
+584,pop,"([1, 2, 3],)","[1, 2]",list(int) -> list(int)
+585,count-head-in-tail,"([4, 2, 6, 10, 8, 12],)",0,list(int) -> int
+586,rotate-k with k=3,"([15, 9, 4, 8, 5, 5, 11, 4, 5, 11, 4, 11, 13, 15, 14, 8],)","[15, 14, 8, 15, 9, 4, 8, 5, 5, 11, 4, 5, 11, 4, 11, 13]",list(int) -> list(int)
+587,bool-identify-k with k=5,"([],)",[],list(int) -> list(bool)
+588,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 0],)","[0, 1]",list(int) -> list(int)
+589,slice-k-n with k=2 and n=2,"([8, 1, 15, 13, 12, 15, 14, 11, 13, 2, 5],)","[1, 15]",list(int) -> list(int)
+590,take-k with k=1,"([1, 16, 3, 16, 0],)",[1],list(int) -> list(int)
+591,slice-k-n with k=1 and n=3,"([12, 14, 2, 14, 0, 9, 8],)","[12, 14, 2]",list(int) -> list(int)
+592,add-k with k=4,"([9, 3, 7, 14],)","[13, 7, 11, 18]",list(int) -> list(int)
+593,keep gt 3,"([5, 1, 1, 5, 4],)","[5, 5, 4]",list(int) -> list(int)
+594,caesar-cipher-k-modulo-n with k=2 and n=5,"([2, 2],)","[4, 4]",list(int) -> list(int)
+595,is-squares,"([3],)",False,list(int) -> bool
+596,keep eq 1,"([4, 2, 2, 4, 3],)",[],list(int) -> list(int)
+597,caesar-cipher-k-modulo-n with k=5 and n=3,"([2, 0, 0],)","[1, 2, 2]",list(int) -> list(int)
+598,count-head-in-tail,"([10],)",0,list(int) -> int
+599,slice-k-n with k=5 and n=4,"([12, 4, 7, 1, 8, 1, 2, 3, 7, 5],)","[8, 1, 2, 3]",list(int) -> list(int)
+600,keep eq 3,"([4, 0, 5, 4, 3],)",[3],list(int) -> list(int)
+601,remove-index-k with k=3,"([9, 11, 13, 2, 9],)","[9, 11, 2, 9]",list(int) -> list(int)
+602,prepend-index-k with k=1,"([9, 8, 10, 8, 4],)","[9, 9, 8, 10, 8, 4]",list(int) -> list(int)
+603,head,"([1, 1, 2, 1],)",1,list(int) -> int
+604,slice-k-n with k=4 and n=1,"([0, 0, 3, 2, 15, 14, 2],)",[2],list(int) -> list(int)
+605,replace-all-with-index-k with k=5,"([15, 5, 16, 14, 4, 6, 15, 12, 9, 13, 15],)","[4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]",list(int) -> list(int)
+606,odds,"([5, 16, 4, 8],)",[5],list(int) -> list(int)
+607,rotate-k with k=5,"([1, 3, 9, 11, 15, 2],)","[3, 9, 11, 15, 2, 1]",list(int) -> list(int)
+608,mult-k with k=2,"([12, 13, 2, 4, 7, 15, 12],)","[24, 26, 4, 8, 14, 30, 24]",list(int) -> list(int)
+609,min,"([11, 15, 2, 0],)",0,list(int) -> int
+610,remove eq 0,"([3, 4, 0, 0, 5],)","[3, 4, 5]",list(int) -> list(int)
+611,bool-identify-k with k=4,"([4, 4, 4, 4, 4, 4],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+612,is-odds,"([11, 33, 21, 33, 17, 15],)",True,list(int) -> bool
+613,kth-smallest with k=5,"([13, 4, 9, 6, 7, 6, 12, 4, 8, 16, 4],)",6,list(int) -> int
+614,prepend-k with k=3,"([0, 6],)","[3, 0, 6]",list(int) -> list(int)
+615,keep gt 2,"([0, 3, 3, 6, 0],)","[3, 3, 6]",list(int) -> list(int)
+616,modulo-k with k=2,"([5, 11, 4, 14, 13],)","[1, 1, 0, 0, 1]",list(int) -> list(int)
+617,append-index-k with k=2,"([12, 14, 9],)","[12, 14, 9, 14]",list(int) -> list(int)
+618,kth-smallest with k=4,"([12, 9, 10, 2, 3, 5, 1, 8],)",5,list(int) -> int
+619,append-index-k with k=1,"([8, 10, 0, 16],)","[8, 10, 0, 16, 8]",list(int) -> list(int)
+620,odds,"([4, 2],)",[],list(int) -> list(int)
+621,remove-mod-k with k=5,"([10, 15, 40],)",[],list(int) -> list(int)
+622,remove-mod-k with k=3,"([3],)",[],list(int) -> list(int)
+623,kth-largest with k=2,"([7, 3, 2, 8],)",7,list(int) -> int
+624,bool-identify-k with k=2,"([0, 8, 7, 2, 5, 2],)","[False, False, False, True, False, True]",list(int) -> list(bool)
+625,remove gt 0,"([2, 5, 6, 6, 3],)",[],list(int) -> list(int)
+626,dup,"([1, 7, 2, 6, 6, 9],)","[1, 1, 7, 7, 2, 2, 6, 6, 6, 6, 9, 9]",list(int) -> list(int)
+627,bool-identify-k with k=3,"([12],)",[False],list(int) -> list(bool)
+628,product,"([7, 15],)",105,list(int) -> int
+629,take-k with k=1,"([11, 16],)",[11],list(int) -> list(int)
+630,slice-k-n with k=3 and n=4,"([15, 11, 1, 3, 16, 2, 15, 2, 16, 5],)","[1, 3, 16, 2]",list(int) -> list(int)
+631,product,"([0],)",0,list(int) -> int
+632,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 2, 2, 1],)","[0, 1, 1, 0]",list(int) -> list(int)
+633,slice-k-n with k=5 and n=5,"([0, 13, 5, 7, 16, 11, 12, 2, 0, 3, 9, 14, 6, 2],)","[16, 11, 12, 2, 0]",list(int) -> list(int)
+634,last,"([1, 9, 14, 16],)",16,list(int) -> int
+635,keep-mod-k with k=3,"([4, 3, 7],)",[3],list(int) -> list(int)
+636,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 2, 2, 1],)","[2, 0, 0, 2]",list(int) -> list(int)
+637,slice-k-n with k=2 and n=4,"([12, 0, 15, 7, 3, 16, 15, 16, 12, 13],)","[0, 15, 7, 3]",list(int) -> list(int)
+638,bool-identify-k with k=1,"([8, 7],)","[False, False]",list(int) -> list(bool)
+639,append-k with k=1,"([16, 13, 14, 9, 10, 15],)","[16, 13, 14, 9, 10, 15, 1]",list(int) -> list(int)
+640,keep primes,"([8, 6, 19, 13, 11, 3, 17],)","[19, 13, 11, 3, 17]",list(int) -> list(int)
+641,modulo-k with k=2,"([7, 0, 3, 12, 12],)","[1, 0, 1, 0, 0]",list(int) -> list(int)
+642,prepend-k with k=1,"([9, 3, 5, 6, 11, 12],)","[1, 9, 3, 5, 6, 11, 12]",list(int) -> list(int)
+643,rotate-k with k=5,"([15, 10, 0, 9, 16, 3, 3, 11, 16, 0, 1, 1, 4, 13],)","[0, 1, 1, 4, 13, 15, 10, 0, 9, 16, 3, 3, 11, 16]",list(int) -> list(int)
+644,product,"([11, 9, 9],)",891,list(int) -> int
+645,replace-all-with-index-k with k=4,"([12, 16, 4, 8, 4, 0, 0, 16, 14, 7],)","[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]",list(int) -> list(int)
+646,drop-k with k=5,"([15, 6, 2, 1, 7, 7, 2, 11, 14, 6, 7, 11],)","[7, 2, 11, 14, 6, 7, 11]",list(int) -> list(int)
+647,prepend-k with k=2,"([4, 3, 16, 15, 0],)","[2, 4, 3, 16, 15, 0]",list(int) -> list(int)
+648,has-k with k=5,"([2, 8, 0, 14, 3, 10],)",False,list(int) -> bool
+649,remove-index-k with k=4,"([7, 14, 8, 15, 8],)","[7, 14, 8, 8]",list(int) -> list(int)
+650,append-index-k with k=5,"([15, 15, 9, 4, 2, 2, 14, 13, 5, 4],)","[15, 15, 9, 4, 2, 2, 14, 13, 5, 4, 2]",list(int) -> list(int)
+651,keep-mod-k with k=4,"([2, 7, 3, 3],)",[],list(int) -> list(int)
+652,kth-largest with k=2,"([14, 1],)",1,list(int) -> int
+653,prepend-index-k with k=2,"([11, 6, 10],)","[6, 11, 6, 10]",list(int) -> list(int)
+654,append-k with k=3,"([6, 15, 6],)","[6, 15, 6, 3]",list(int) -> list(int)
+655,fibonacci,"(9,)",34,int -> int
+656,slice-k-n with k=4 and n=5,"([7, 4, 12, 1, 11, 13, 14, 11, 11, 2, 2, 0, 14, 15],)","[1, 11, 13, 14, 11]",list(int) -> list(int)
+657,slice-k-n with k=4 and n=2,"([4, 15, 8, 1, 13, 7, 5],)","[1, 13]",list(int) -> list(int)
+658,count-k with k=2,"([9, 16, 3, 2, 7, 2],)",2,list(int) -> int
+659,prepend-k with k=3,"([10, 0, 8, 0],)","[3, 10, 0, 8, 0]",list(int) -> list(int)
+660,remove gt 0,"([5, 1, 4, 0, 4],)",[0],list(int) -> list(int)
+661,mult-k with k=0,"([7, 11, 13, 15, 16, 16],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+662,last,"([6, 1, 4, 12, 12, 0],)",0,list(int) -> int
+663,bool-identify-is-mod-k with k=1,"([3, 6, 1, 15, 12, 13],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+664,append-index-k with k=3,"([12, 7, 16, 14],)","[12, 7, 16, 14, 16]",list(int) -> list(int)
+665,keep primes,"([29, 19, 3, 5, 2, 8, 23],)","[29, 19, 3, 5, 2, 23]",list(int) -> list(int)
+666,kth-smallest with k=1,"([10],)",10,list(int) -> int
+667,kth-smallest with k=3,"([16, 5, 4, 5, 2, 14, 6, 9, 15],)",5,list(int) -> int
+668,bool-identify-is-mod-k with k=4,"([8, 14],)","[True, False]",list(int) -> list(bool)
+669,slice-k-n with k=4 and n=5,"([5, 14, 2, 6, 12, 5, 6, 10, 4, 8, 14, 12],)","[6, 12, 5, 6, 10]",list(int) -> list(int)
+670,caesar-cipher-k-modulo-n with k=5 and n=2,"([0],)",[1],list(int) -> list(int)
+671,kth-largest with k=5,"([6, 2, 1, 7, 7, 2, 11, 14, 6, 7, 11, 13],)",7,list(int) -> int
+672,slice-k-n with k=3 and n=3,"([5, 3, 4, 11, 12, 2, 8, 12],)","[4, 11, 12]",list(int) -> list(int)
+673,drop-k with k=1,"([15, 1],)",[1],list(int) -> list(int)
+674,take-k with k=5,"([7, 12, 15, 13, 10, 16, 8, 4, 6, 7],)","[7, 12, 15, 13, 10]",list(int) -> list(int)
+675,append-index-k with k=3,"([11, 11, 2, 9],)","[11, 11, 2, 9, 2]",list(int) -> list(int)
+676,remove gt 3,"([0, 4, 3, 0, 6],)","[0, 3, 0]",list(int) -> list(int)
+677,remove eq 1,"([0, 4, 3, 2, 4],)","[0, 4, 3, 2, 4]",list(int) -> list(int)
+678,count-k with k=4,"([2, 7, 3, 3],)",0,list(int) -> int
+679,caesar-cipher-k-modulo-n with k=1 and n=5,"([2, 1, 2, 4],)","[3, 2, 3, 0]",list(int) -> list(int)
+680,count-k with k=5,"([5],)",1,list(int) -> int
+681,append-index-k with k=2,"([1, 3, 1, 4, 15],)","[1, 3, 1, 4, 15, 3]",list(int) -> list(int)
+682,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 2, 2, 1],)","[2, 0, 0, 2]",list(int) -> list(int)
+683,is-odds,"([9, 7, 27],)",True,list(int) -> bool
+684,bool-identify-k with k=0,"([0, 0, 0, 14, 9],)","[True, True, True, False, False]",list(int) -> list(bool)
+685,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 0, 1, 1],)","[2, 1, 2, 2]",list(int) -> list(int)
+686,replace-all-with-index-k with k=2,"([10, 3, 5, 8, 3, 7, 14, 1],)","[3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+687,pow-k with k=2,"([3],)",[9],list(int) -> list(int)
+688,fibonacci,"(9,)",34,int -> int
+689,slice-k-n with k=1 and n=1,"([4, 9, 0, 9, 13],)",[4],list(int) -> list(int)
+690,repeat-k with k=5,"([15, 7, 7],)","[15, 7, 7, 15, 7, 7, 15, 7, 7, 15, 7, 7, 15, 7, 7]",list(int) -> list(int)
+691,replace-all-with-index-k with k=1,"([7, 6],)","[7, 7]",list(int) -> list(int)
+692,is-mod-k with k=3,"([1, 6, 11, 14, 7, 6, 2],)",False,list(int) -> bool
+693,modulo-k with k=2,"([1],)",[1],list(int) -> list(int)
+694,remove-mod-k with k=3,"([10, 5, 6],)","[10, 5]",list(int) -> list(int)
+695,take-k with k=5,"([4, 9, 11, 7, 11, 10, 1, 7, 1, 8, 1, 1],)","[4, 9, 11, 7, 11]",list(int) -> list(int)
+696,odds,"([5],)",[5],list(int) -> list(int)
+697,remove gt 3,"([3, 2, 0, 6, 0],)","[3, 2, 0, 0]",list(int) -> list(int)
+698,bool-identify-is-mod-k with k=5,"([5],)",[True],list(int) -> list(bool)
+699,repeat-k with k=4,"([9, 3, 9, 14],)","[9, 3, 9, 14, 9, 3, 9, 14, 9, 3, 9, 14, 9, 3, 9, 14]",list(int) -> list(int)
+700,keep squares,"([2, 1, 16, 9, 4, 0, 1],)","[1, 16, 9, 4, 0, 1]",list(int) -> list(int)
+701,dup,"([7, 2, 4],)","[7, 7, 2, 2, 4, 4]",list(int) -> list(int)
+702,is-mod-k with k=5,"([12, 10, 16, 6, 8, 13],)",False,list(int) -> bool
+703,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 1, 0, 0],)","[0, 0, 2, 2]",list(int) -> list(int)
+704,sort-and-deduplicate,"([9, 0],)","[0, 9]",list(int) -> list(int)
+705,remove-index-k with k=4,"([5, 6, 2, 15, 9, 1, 6],)","[5, 6, 2, 9, 1, 6]",list(int) -> list(int)
+706,mult-k with k=5,"([4, 12, 3, 15, 5, 5, 2],)","[20, 60, 15, 75, 25, 25, 10]",list(int) -> list(int)
+707,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 0, 1, 0, 1, 0],)","[1, 1, 0, 1, 0, 1]",list(int) -> list(int)
+708,remove-index-k with k=2,"([9, 5],)",[9],list(int) -> list(int)
+709,replace-all-with-index-k with k=1,"([1, 11, 15, 14, 15],)","[1, 1, 1, 1, 1]",list(int) -> list(int)
+710,prepend-k with k=2,"([13],)","[2, 13]",list(int) -> list(int)
+711,remove-mod-k with k=4,"([20, 11, 0, 20, 24, 10, 24],)","[11, 10]",list(int) -> list(int)
+712,empty,"([1, 2, 3],)",False,list(int) -> bool
+713,is-squares,"([1, 4, 9],)",True,list(int) -> bool
+714,remove-index-k with k=3,"([5, 4, 5, 2, 14, 6, 9, 15, 1, 1],)","[5, 4, 2, 14, 6, 9, 15, 1, 1]",list(int) -> list(int)
+715,index-head,"([1, 3],)",3,list(int) -> int
+716,modulo-k with k=3,"([4, 4, 12, 7, 13, 9],)","[1, 1, 0, 1, 1, 0]",list(int) -> list(int)
+717,slice-k-n with k=4 and n=3,"([8, 4, 3, 7, 1, 10, 14, 7],)","[7, 1, 10]",list(int) -> list(int)
+718,kth-smallest with k=3,"([11, 8, 8, 5, 6, 2, 15, 9, 1, 6],)",5,list(int) -> int
+719,len,"([0],)",1,list(int) -> int
+720,prepend-k with k=1,"([5],)","[1, 5]",list(int) -> list(int)
+721,mult-k with k=2,"([9, 5, 11, 4, 6],)","[18, 10, 22, 8, 12]",list(int) -> list(int)
+722,bool-identify-geq-k with k=4,"([7, 10, 16],)","[True, True, True]",list(int) -> list(bool)
+723,remove-mod-k with k=4,"([4, 14, 15, 1],)","[14, 15, 1]",list(int) -> list(int)
+724,mult-k with k=5,"([3, 6, 6, 16],)","[15, 30, 30, 80]",list(int) -> list(int)
+725,remove eq 2,"([3, 1, 2, 0, 1],)","[3, 1, 0, 1]",list(int) -> list(int)
+726,prepend-k with k=0,"([],)",[0],list(int) -> list(int)
+727,modulo-k with k=2,"([0, 9, 12, 7, 0],)","[0, 1, 0, 1, 0]",list(int) -> list(int)
+728,is-mod-k with k=1,"([9, 10, 4],)",True,list(int) -> bool
+729,drop-k with k=1,"([8],)",[],list(int) -> list(int)
+730,append-k with k=2,"([4, 2, 12, 14, 9],)","[4, 2, 12, 14, 9, 2]",list(int) -> list(int)
+731,remove-index-k with k=1,"([16],)",[],list(int) -> list(int)
+732,range,"(1,)",[0],int -> list(int)
+733,caesar-cipher-k-modulo-n with k=4 and n=5,"([1, 0, 2, 2, 2, 0, 2],)","[0, 4, 1, 1, 1, 4, 1]",list(int) -> list(int)
+734,replace-all-with-index-k with k=2,"([11, 7, 16, 14, 13, 12],)","[7, 7, 7, 7, 7, 7]",list(int) -> list(int)
+735,keep gt 1,"([2, 2, 0, 2, 4],)","[2, 2, 2, 4]",list(int) -> list(int)
+736,remove eq 3,"([2, 5, 4, 3, 6],)","[2, 5, 4, 6]",list(int) -> list(int)
+737,mult-k with k=4,"([3],)",[12],list(int) -> list(int)
+738,bool-identify-is-prime,"([5, 11, 12],)","[True, True, False]",list(int) -> list(bool)
+739,max,"([12, 11, 5, 12, 1, 2],)",12,list(int) -> int
+740,slice-k-n with k=5 and n=3,"([10, 16, 5, 12, 15, 15, 10, 9, 1, 4, 7, 12, 2, 15, 12, 14],)","[15, 15, 10]",list(int) -> list(int)
+741,has-k with k=5,"([5, 5, 5],)",True,list(int) -> bool
+742,remove eq 2,"([6, 4, 5, 0, 0],)","[6, 4, 5, 0, 0]",list(int) -> list(int)
+743,pow-k with k=2,"([2, 7],)","[4, 49]",list(int) -> list(int)
+744,drop-k with k=4,"([7, 2, 7, 14, 6, 0, 2, 14, 2, 16],)","[6, 0, 2, 14, 2, 16]",list(int) -> list(int)
+745,modulo-k with k=5,"([13],)",[3],list(int) -> list(int)
+746,bool-identify-is-mod-k with k=4,"([0, 1, 2, 14, 3, 9, 12],)","[True, False, False, False, False, False, True]",list(int) -> list(bool)
+747,slice-k-n with k=3 and n=5,"([8, 5, 10, 10, 13, 4, 5, 1, 4, 5],)","[10, 10, 13, 4, 5]",list(int) -> list(int)
+748,remove gt 2,"([3, 6, 2, 3, 6],)",[2],list(int) -> list(int)
+749,bool-identify-is-prime,"([5],)",[True],list(int) -> list(bool)
+750,is-odds,"([17, 3, 21, 9],)",True,list(int) -> bool
+751,bool-identify-k with k=4,"([],)",[],list(int) -> list(bool)
+752,prepend-k with k=0,"([1],)","[0, 1]",list(int) -> list(int)
+753,is-mod-k with k=3,"([39, 27, 6, 33, 12, 39, 33],)",True,list(int) -> bool
+754,remove-mod-k with k=2,"([7, 0, 4, 12],)",[7],list(int) -> list(int)
+755,kth-smallest with k=2,"([3, 11],)",11,list(int) -> int
+756,bool-identify-geq-k with k=5,"([15, 7, 10, 3, 8],)","[True, True, True, False, True]",list(int) -> list(bool)
+757,is-mod-k with k=2,"([11, 6, 0, 3],)",False,list(int) -> bool
+758,drop-k with k=1,"([6, 8, 8, 1, 9],)","[8, 8, 1, 9]",list(int) -> list(int)
+759,drop-k with k=5,"([4, 14, 0, 12, 7],)",[],list(int) -> list(int)
+760,bool-identify-is-mod-k with k=5,"([10],)",[True],list(int) -> list(bool)
+761,caesar-cipher-k-modulo-n with k=4 and n=5,"([2, 2],)","[1, 1]",list(int) -> list(int)
+762,bool-identify-is-mod-k with k=4,"([10, 4, 4],)","[False, True, True]",list(int) -> list(bool)
+763,prepend-k with k=1,"([9, 6, 16, 11],)","[1, 9, 6, 16, 11]",list(int) -> list(int)
+764,append-k with k=2,"([1, 5, 15],)","[1, 5, 15, 2]",list(int) -> list(int)
+765,count-head-in-tail,"([4],)",0,list(int) -> int
+766,evens,"([6, 4, 7],)","[6, 4]",list(int) -> list(int)
+767,bool-identify-is-mod-k with k=2,"([5, 16, 12],)","[False, True, True]",list(int) -> list(bool)
+768,add-k with k=3,"([7, 11, 6, 14, 4],)","[10, 14, 9, 17, 7]",list(int) -> list(int)
+769,prepend-index-k with k=2,"([15, 6],)","[6, 15, 6]",list(int) -> list(int)
+770,append-k with k=4,"([2, 16, 15, 0, 13, 10, 7],)","[2, 16, 15, 0, 13, 10, 7, 4]",list(int) -> list(int)
+771,slice-k-n with k=4 and n=2,"([5, 5, 10, 13, 4, 1, 14, 4],)","[13, 4]",list(int) -> list(int)
+772,bool-identify-geq-k with k=1,"([3, 3, 3, 3],)","[True, True, True, True]",list(int) -> list(bool)
+773,kth-smallest with k=3,"([9, 5, 11, 2, 10, 13, 9],)",9,list(int) -> int
+774,evens,"([7, 0, 12, 7],)","[0, 12]",list(int) -> list(int)
+775,is-mod-k with k=4,"([28, 0, 44],)",True,list(int) -> bool
+776,bool-identify-k with k=1,"([1],)",[True],list(int) -> list(bool)
+777,dup,"([15],)","[15, 15]",list(int) -> list(int)
+778,rotate-k with k=2,"([12, 3, 15, 13],)","[15, 13, 12, 3]",list(int) -> list(int)
+779,rotate-k with k=3,"([13, 12, 0, 3, 11, 2, 9, 13, 0, 10, 2, 5, 7, 6, 4, 13, 1],)","[4, 13, 1, 13, 12, 0, 3, 11, 2, 9, 13, 0, 10, 2, 5, 7, 6]",list(int) -> list(int)
+780,tail,"([0, 1, 0, 2, 11, 0],)","[1, 0, 2, 11, 0]",list(int) -> list(int)
+781,slice-k-n with k=3 and n=5,"([3, 15, 15, 7, 15, 7, 11, 15, 14, 5, 4, 7, 10, 6, 4, 2],)","[15, 7, 15, 7, 11]",list(int) -> list(int)
+782,index-k with k=5,"([11, 11, 12, 5, 13, 11],)",13,list(int) -> int
+783,slice-k-n with k=5 and n=3,"([6, 8, 14, 14, 10, 8, 3, 15, 3],)","[10, 8, 3]",list(int) -> list(int)
+784,keep gt 1,"([2, 5, 3, 6, 0],)","[2, 5, 3, 6]",list(int) -> list(int)
+785,caesar-cipher-k-modulo-n with k=3 and n=5,"([3, 1, 1, 4, 1, 2],)","[1, 4, 4, 2, 4, 0]",list(int) -> list(int)
+786,repeat-k with k=5,"([7, 6],)","[7, 6, 7, 6, 7, 6, 7, 6, 7, 6]",list(int) -> list(int)
+787,replace-all-with-index-k with k=1,"([4, 2, 6],)","[4, 4, 4]",list(int) -> list(int)
+788,last,"([1, 1, 2, 1],)",1,list(int) -> int
+789,+1 maximum list,"([1, 1, 7, 6],)",8,list(int) -> int
+790,pow-k with k=2,"([13, 11, 10, 12, 13],)","[169, 121, 100, 144, 169]",list(int) -> list(int)
+791,has-k with k=1,"([6, 0, 3, 16],)",False,list(int) -> bool
+792,remove gt 3,"([2, 5, 5, 4, 3],)","[2, 3]",list(int) -> list(int)
+793,range +1 maximum list,"([0, 3],)","[0, 1, 2, 3]",list(int) -> list(int)
+794,sum,"([2],)",2,list(int) -> int
+795,slice-k-n with k=1 and n=4,"([3, 8, 9, 15, 11, 10, 0, 15, 16, 8, 15, 1],)","[3, 8, 9, 15]",list(int) -> list(int)
+796,replace-all-with-index-k with k=4,"([10, 10, 0, 5, 7, 16, 2, 7, 8, 16],)","[5, 5, 5, 5, 5, 5, 5, 5, 5, 5]",list(int) -> list(int)
+797,append-index-k with k=5,"([0, 12, 0, 0, 15, 9, 9, 9, 2],)","[0, 12, 0, 0, 15, 9, 9, 9, 2, 15]",list(int) -> list(int)
+798,has-k with k=0,"([5, 7, 6, 8, 3],)",False,list(int) -> bool
+799,caesar-cipher-k-modulo-n with k=1 and n=4,"([1, 2],)","[2, 3]",list(int) -> list(int)
+800,caesar-cipher-k-modulo-n with k=3 and n=4,"([0, 3, 1, 2, 3, 0, 0],)","[3, 2, 0, 1, 2, 3, 3]",list(int) -> list(int)
+801,slice-k-n with k=3 and n=1,"([3, 4, 14, 6, 13, 1, 6, 5],)",[14],list(int) -> list(int)
+802,remove gt 1,"([1, 4, 5, 6, 2],)",[1],list(int) -> list(int)
+803,keep gt 2,"([1, 3, 5, 2, 3],)","[3, 5, 3]",list(int) -> list(int)
+804,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 1, 1, 0, 1, 1, 0],)","[0, 0, 0, 1, 0, 0, 1]",list(int) -> list(int)
+805,keep-mod-k with k=3,"([0, 0, 15, 4, 16],)","[0, 0, 15]",list(int) -> list(int)
+806,add-k with k=1,"([8, 13, 6],)","[9, 14, 7]",list(int) -> list(int)
+807,slice-k-n with k=2 and n=3,"([13, 5, 3, 16, 8, 12],)","[5, 3, 16]",list(int) -> list(int)
+808,replace-all-with-index-k with k=3,"([12, 6, 11, 4],)","[11, 11, 11, 11]",list(int) -> list(int)
+809,slice-k-n with k=5 and n=1,"([16, 12, 11, 12, 3, 4, 0, 2, 13, 16, 6, 13, 5],)",[3],list(int) -> list(int)
+810,prepend-index-k with k=4,"([1, 10, 1, 10, 5, 16],)","[10, 1, 10, 1, 10, 5, 16]",list(int) -> list(int)
+811,caesar-cipher-k-modulo-n with k=5 and n=4,"([2, 2, 0, 1, 2, 3, 3],)","[3, 3, 1, 2, 3, 0, 0]",list(int) -> list(int)
+812,slice-k-n with k=4 and n=3,"([12, 12, 13, 16, 8, 14, 6, 13],)","[16, 8, 14]",list(int) -> list(int)
+813,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 1, 1],)","[1, 0, 0]",list(int) -> list(int)
+814,index-k with k=2,"([3, 10],)",10,list(int) -> int
+815,remove-index-k with k=1,"([6, 10, 8, 14, 2, 12],)","[10, 8, 14, 2, 12]",list(int) -> list(int)
+816,remove-index-k with k=4,"([4, 0, 6, 0],)","[4, 0, 6]",list(int) -> list(int)
+817,kth-smallest with k=4,"([6, 14, 4, 7, 12, 4, 3],)",6,list(int) -> int
+818,kth-smallest with k=3,"([15, 4, 8, 5],)",8,list(int) -> int
+819,append-index-k with k=2,"([0, 6, 13, 5],)","[0, 6, 13, 5, 6]",list(int) -> list(int)
+820,is-mod-k with k=5,"([15, 16, 9, 6],)",False,list(int) -> bool
+821,remove-mod-head,"([9, 0, 15, 1],)","[15, 1]",list(int) -> list(int)
+822,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 0, 1],)","[1, 1, 0]",list(int) -> list(int)
+823,keep-mod-k with k=5,"([12, 13, 2, 15, 11],)",[15],list(int) -> list(int)
+824,caesar-cipher-k-modulo-n with k=3 and n=5,"([1],)",[4],list(int) -> list(int)
+825,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 0, 2, 1, 3, 2],)","[3, 1, 3, 2, 0, 3]",list(int) -> list(int)
+826,sum,"([1, 6, 12, 1, 7],)",27,list(int) -> int
+827,count-k with k=3,"([3, 3, 3, 3, 3, 6, 3],)",6,list(int) -> int
+828,repeat-k with k=3,"([6, 11],)","[6, 11, 6, 11, 6, 11]",list(int) -> list(int)
+829,slice-k-n with k=2 and n=1,"([15, 15, 0, 9, 9, 15, 15, 3, 4],)",[15],list(int) -> list(int)
+830,add-k with k=2,"([8, 6, 14, 7, 14, 16, 13],)","[10, 8, 16, 9, 16, 18, 15]",list(int) -> list(int)
+831,index-k with k=5,"([1, 7, 3, 16, 10, 12, 14, 12, 16, 13, 8, 3],)",10,list(int) -> int
+832,replace-all-with-index-k with k=4,"([16, 4, 3, 7, 13, 13, 0, 6, 4],)","[7, 7, 7, 7, 7, 7, 7, 7, 7]",list(int) -> list(int)
+833,drop-k with k=5,"([7, 13, 16, 12, 4, 5],)",[5],list(int) -> list(int)
+834,keep-mod-k with k=4,"([],)",[],list(int) -> list(int)
+835,is-mod-k with k=1,"([6, 11, 0, 11, 7, 9],)",True,list(int) -> bool
+836,count-head-in-tail,"([1, 2, 3],)",0,list(int) -> int
+837,slice-k-n with k=2 and n=3,"([7, 0, 2, 0, 3, 8, 2, 0, 5, 2],)","[0, 2, 0]",list(int) -> list(int)
+838,index-k with k=1,"([5, 16, 10, 16, 8, 7, 2],)",5,list(int) -> int
+839,remove eq 0,"([4, 4, 2, 5, 6],)","[4, 4, 2, 5, 6]",list(int) -> list(int)
+840,has-head-in-tail,"([1, 2, 3],)",False,list(int) -> bool
+841,remove gt 3,"([4, 6, 2, 3, 5],)","[2, 3]",list(int) -> list(int)
+842,replace-all-with-index-k with k=2,"([12, 15],)","[15, 15]",list(int) -> list(int)
+843,bool-identify-geq-k with k=5,"([2, 5, 4, 2, 12, 2],)","[False, True, False, False, True, False]",list(int) -> list(bool)
+844,modulo-k with k=4,"([0, 13, 1, 10, 5, 2, 8],)","[0, 1, 1, 2, 1, 2, 0]",list(int) -> list(int)
+845,rotate-k with k=5,"([4, 14, 0, 5, 2, 1, 1, 7, 1, 1, 1, 3, 13, 16, 0],)","[1, 3, 13, 16, 0, 4, 14, 0, 5, 2, 1, 1, 7, 1, 1]",list(int) -> list(int)
+846,keep squares,"([25, 8, 4, 3, 25, 8, 6],)","[25, 4, 25]",list(int) -> list(int)
+847,slice-k-n with k=3 and n=1,"([7, 7, 11, 6, 12, 5, 5],)",[11],list(int) -> list(int)
+848,slice-k-n with k=2 and n=3,"([2, 13, 8, 6, 3, 9, 0, 11, 6, 7, 4],)","[13, 8, 6]",list(int) -> list(int)
+849,append-k with k=1,"([5, 11, 5, 15, 11, 1, 3],)","[5, 11, 5, 15, 11, 1, 3, 1]",list(int) -> list(int)
+850,append-k with k=5,"([9],)","[9, 5]",list(int) -> list(int)
+851,sort-and-deduplicate,"([5, 3],)","[3, 5]",list(int) -> list(int)
+852,slice-k-n with k=4 and n=3,"([13, 5, 14, 11, 1, 3, 12, 7, 14, 10, 15, 10, 2],)","[11, 1, 3]",list(int) -> list(int)
+853,slice-k-n with k=2 and n=4,"([15, 16, 14, 9, 16, 13, 10, 3, 13, 9, 11],)","[16, 14, 9, 16]",list(int) -> list(int)
+854,count-k with k=4,"([],)",0,list(int) -> int
+855,sum,"([11],)",11,list(int) -> int
+856,append-k with k=4,"([14, 14, 2, 9, 2],)","[14, 14, 2, 9, 2, 4]",list(int) -> list(int)
+857,drop-k with k=3,"([2, 5, 14, 8, 8],)","[8, 8]",list(int) -> list(int)
+858,prepend-index-k with k=2,"([2, 14, 3, 15, 14, 3, 5, 15],)","[14, 2, 14, 3, 15, 14, 3, 5, 15]",list(int) -> list(int)
+859,count-k with k=0,"([9, 15, 4, 7],)",0,list(int) -> int
+860,index-head,"([1, 11],)",11,list(int) -> int
+861,count-k with k=4,"([2, 7, 12],)",0,list(int) -> int
+862,range +1 maximum list,"([2, 10],)","[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]",list(int) -> list(int)
+863,take-k with k=4,"([5, 2, 4, 3],)","[5, 2, 4, 3]",list(int) -> list(int)
+864,keep gt 3,"([4, 5, 1, 1, 1],)","[4, 5]",list(int) -> list(int)
+865,remove-mod-k with k=5,"([9, 5, 10, 5, 13, 14, 0],)","[9, 13, 14]",list(int) -> list(int)
+866,add-k with k=5,"([12],)",[17],list(int) -> list(int)
+867,remove-mod-k with k=5,"([5, 2, 1],)","[2, 1]",list(int) -> list(int)
+868,min,"([14, 1, 3],)",1,list(int) -> int
+869,remove-index-k with k=5,"([5, 11, 14, 2, 1, 3, 2, 13],)","[5, 11, 14, 2, 3, 2, 13]",list(int) -> list(int)
+870,modulo-k with k=4,"([2, 3, 14, 5, 3, 3],)","[2, 3, 2, 1, 3, 3]",list(int) -> list(int)
+871,slice-k-n with k=2 and n=2,"([6, 16, 14, 2, 4, 13, 11, 11, 12, 4],)","[16, 14]",list(int) -> list(int)
+872,empty,"([2, 16, 2, 5, 15, 6, 7],)",False,list(int) -> bool
+873,tail,"([5],)",[],list(int) -> list(int)
+874,remove-index-k with k=1,"([0, 10, 4, 11, 14],)","[10, 4, 11, 14]",list(int) -> list(int)
+875,keep eq 2,"([4, 5, 6, 4, 2],)",[2],list(int) -> list(int)
+876,caesar-cipher-k-modulo-n with k=1 and n=5,"([2, 2],)","[3, 3]",list(int) -> list(int)
+877,is-mod-k with k=2,"([6, 10, 9, 1],)",False,list(int) -> bool
+878,remove gt 1,"([5, 0, 0, 6, 0],)","[0, 0, 0]",list(int) -> list(int)
+879,pow-k with k=5,"([14, 13, 8, 15, 8, 10, 0],)","[537824, 371293, 32768, 759375, 32768, 100000, 0]",list(int) -> list(int)
+880,drop-k with k=4,"([0, 13, 4, 2],)",[],list(int) -> list(int)
+881,count-k with k=2,"([8],)",0,list(int) -> int
+882,keep squares,"([4, 9, 0, 0, 8, 9, 2],)","[4, 9, 0, 0, 9]",list(int) -> list(int)
+883,bool-identify-geq-k with k=4,"([15, 3, 3, 1, 3],)","[True, False, False, False, False]",list(int) -> list(bool)
+884,count-k with k=3,"([2, 13],)",0,list(int) -> int
+885,bool-identify-is-prime,"([10, 8, 4, 7],)","[False, False, False, True]",list(int) -> list(bool)
+886,has-k with k=5,"([3, 6, 1, 15, 12, 13],)",False,list(int) -> bool
+887,is-mod-k with k=3,"([9, 9, 0, 21, 27, 30, 30],)",True,list(int) -> bool
+888,repeat-k with k=4,"([6],)","[6, 6, 6, 6]",list(int) -> list(int)
+889,index-k with k=1,"([2, 12, 11, 14, 15, 9, 8],)",2,list(int) -> int
+890,slice-k-n with k=3 and n=1,"([5, 6, 10, 0, 13],)",[10],list(int) -> list(int)
+891,repeat-k with k=2,"([3, 12, 15, 12],)","[3, 12, 15, 12, 3, 12, 15, 12]",list(int) -> list(int)
+892,slice-k-n with k=1 and n=1,"([5, 14, 5, 2, 13, 1, 7, 13, 1, 1],)",[5],list(int) -> list(int)
+893,caesar-cipher-k-modulo-n with k=1 and n=4,"([],)",[],list(int) -> list(int)
+894,add-k with k=3,"([8, 6, 10],)","[11, 9, 13]",list(int) -> list(int)
+895,slice-k-n with k=5 and n=5,"([4, 5, 3, 2, 6, 16, 16, 15, 11, 11, 16, 3, 16],)","[6, 16, 16, 15, 11]",list(int) -> list(int)
+896,bool-identify-k with k=3,"([13, 7, 9, 10],)","[False, False, False, False]",list(int) -> list(bool)
+897,replace-all-with-index-k with k=2,"([5, 5, 0, 11, 6, 14],)","[5, 5, 5, 5, 5, 5]",list(int) -> list(int)
+898,last,"([4, 6, 12],)",12,list(int) -> int
+899,append-index-k with k=4,"([5, 3, 7, 1, 14, 0, 0, 2],)","[5, 3, 7, 1, 14, 0, 0, 2, 1]",list(int) -> list(int)
+900,append-index-k with k=3,"([1, 2, 1, 7, 12, 15, 12, 13, 11, 4],)","[1, 2, 1, 7, 12, 15, 12, 13, 11, 4, 1]",list(int) -> list(int)
+901,remove-index-k with k=5,"([12, 5, 13, 11, 4, 16, 0, 8, 10, 6],)","[12, 5, 13, 11, 16, 0, 8, 10, 6]",list(int) -> list(int)
+902,head,"([7, 11],)",7,list(int) -> int
+903,slice-k-n with k=4 and n=5,"([14, 8, 12, 8, 2, 14, 1, 2, 15, 2, 14, 0, 0],)","[8, 2, 14, 1, 2]",list(int) -> list(int)
+904,remove empty lists,"([[], [False], [False, True, True], []],)","[[False], [False, True, True]]",list(list(bool)) -> list(list(bool))
+905,is-primes,"([4],)",False,list(int) -> bool
+906,bool-identify-geq-k with k=3,"([4, 0],)","[True, False]",list(int) -> list(bool)
+907,replace-all-with-index-k with k=4,"([10, 1, 3, 13, 10, 14],)","[13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+908,rotate-k with k=5,"([10, 15, 6, 14, 4, 12, 0, 15, 8, 13, 16, 6, 9, 16],)","[13, 16, 6, 9, 16, 10, 15, 6, 14, 4, 12, 0, 15, 8]",list(int) -> list(int)
+909,slice-k-n with k=1 and n=1,"([16, 4, 9, 6, 6, 1],)",[16],list(int) -> list(int)
+910,remove-index-k with k=2,"([2, 16, 6, 4, 4, 1, 5],)","[2, 6, 4, 4, 1, 5]",list(int) -> list(int)
+911,keep gt 0,"([5, 3, 0, 3, 5],)","[5, 3, 3, 5]",list(int) -> list(int)
+912,slice-k-n with k=2 and n=1,"([16, 7, 12, 11, 14, 6, 9, 14, 0, 5],)",[7],list(int) -> list(int)
+913,index-head,"([1, 1],)",1,list(int) -> int
+914,index-head,"([3, 2, 6, 2, 15, 10, 13],)",2,list(int) -> int
+915,odds,"([3, 0],)",[3],list(int) -> list(int)
+916,bool-identify-geq-k with k=3,"([11, 4, 4, 4, 4],)","[True, True, True, True, True]",list(int) -> list(bool)
+917,slice-k-n with k=3 and n=3,"([4, 3, 2, 1, 10, 0, 14, 0, 14],)","[2, 1, 10]",list(int) -> list(int)
+918,caesar-cipher-k-modulo-n with k=3 and n=4,"([2, 3, 0, 1, 2],)","[1, 2, 3, 0, 1]",list(int) -> list(int)
+919,bool-identify-geq-k with k=1,"([6, 1, 3, 4, 15, 3],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+920,keep squares,"([3, 5, 3, 4, 9, 1, 8],)","[4, 9, 1]",list(int) -> list(int)
+921,rotate-k with k=4,"([14, 7, 0, 0, 4, 2, 5, 8, 9, 11, 5, 6, 10, 0, 15, 6, 0],)","[0, 15, 6, 0, 14, 7, 0, 0, 4, 2, 5, 8, 9, 11, 5, 6, 10]",list(int) -> list(int)
+922,remove eq 1,"([2, 1, 1, 5, 4],)","[2, 5, 4]",list(int) -> list(int)
+923,head,"([8, 13, 8, 0, 14, 0, 5],)",8,list(int) -> int
+924,append-index-k with k=5,"([8, 16, 5, 13, 14, 12, 6, 0],)","[8, 16, 5, 13, 14, 12, 6, 0, 14]",list(int) -> list(int)
+925,append-k with k=0,"([3, 16, 10, 0, 8, 6, 4],)","[3, 16, 10, 0, 8, 6, 4, 0]",list(int) -> list(int)
+926,remove-mod-k with k=3,"([12],)",[],list(int) -> list(int)
+927,bool-identify-is-mod-k with k=4,"([8],)",[True],list(int) -> list(bool)
+928,slice-k-n with k=1 and n=3,"([12, 5, 9, 6, 0, 15, 6, 6, 4, 13, 0, 14],)","[12, 5, 9]",list(int) -> list(int)
+929,is-mod-k with k=4,"([7, 7, 6],)",False,list(int) -> bool
+930,append-k with k=5,"([9, 14, 6, 9, 8, 2],)","[9, 14, 6, 9, 8, 2, 5]",list(int) -> list(int)
+931,keep-mod-k with k=4,"([2, 8, 5, 7],)",[8],list(int) -> list(int)
+932,remove gt 3,"([1, 6, 4, 2, 1],)","[1, 2, 1]",list(int) -> list(int)
+933,bool-identify-is-mod-k with k=1,"([],)",[],list(int) -> list(bool)
+934,last,"([16],)",16,list(int) -> int
+935,remove gt 1,"([6, 5, 2, 0, 1],)","[0, 1]",list(int) -> list(int)
+936,remove-mod-k with k=4,"([11, 7, 16, 14, 13, 12, 3],)","[11, 7, 14, 13, 3]",list(int) -> list(int)
+937,remove eq 3,"([0, 1, 3, 4, 3],)","[0, 1, 4]",list(int) -> list(int)
+938,pow-k with k=4,"([10],)",[10000],list(int) -> list(int)
+939,keep eq 0,"([2, 0, 0, 3, 0],)","[0, 0, 0]",list(int) -> list(int)
+940,slice-k-n with k=2 and n=3,"([14, 12, 8, 6, 15, 15, 11, 13, 16, 16, 11, 2, 7],)","[12, 8, 6]",list(int) -> list(int)
+941,repeat-k with k=2,"([],)",[],list(int) -> list(int)
+942,mult-k with k=4,"([3, 5, 7, 4, 4, 6],)","[12, 20, 28, 16, 16, 24]",list(int) -> list(int)
+943,keep gt 2,"([3, 5, 0, 3, 5],)","[3, 5, 3, 5]",list(int) -> list(int)
+944,keep gt 1,"([3, 4, 3, 4, 3],)","[3, 4, 3, 4, 3]",list(int) -> list(int)
+945,sort-and-deduplicate,"([10],)",[10],list(int) -> list(int)
+946,append-k with k=5,"([5],)","[5, 5]",list(int) -> list(int)
+947,is-mod-k with k=5,"([],)",True,list(int) -> bool
+948,append-k with k=3,"([],)",[3],list(int) -> list(int)
+949,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 1, 0],)","[1, 0, 1]",list(int) -> list(int)
+950,add-k with k=2,"([],)",[],list(int) -> list(int)
+951,repeat-k with k=4,"([8, 16],)","[8, 16, 8, 16, 8, 16, 8, 16]",list(int) -> list(int)
+952,add-k with k=2,"([9, 11, 7],)","[11, 13, 9]",list(int) -> list(int)
+953,slice-k-n with k=1 and n=3,"([13, 13, 2, 4, 6, 5, 3],)","[13, 13, 2]",list(int) -> list(int)
+954,mult-k with k=4,"([1, 12, 8, 11, 2, 7],)","[4, 48, 32, 44, 8, 28]",list(int) -> list(int)
+955,tail,"([0, 1, 4],)","[1, 4]",list(int) -> list(int)
+956,append-k with k=5,"([8],)","[8, 5]",list(int) -> list(int)
+957,caesar-cipher-k-modulo-n with k=5 and n=2,"([],)",[],list(int) -> list(int)
+958,repeat-k with k=2,"([6, 7, 16],)","[6, 7, 16, 6, 7, 16]",list(int) -> list(int)
+959,modulo-k with k=5,"([11],)",[1],list(int) -> list(int)
+960,dup,"([0, 5, 8, 16],)","[0, 0, 5, 5, 8, 8, 16, 16]",list(int) -> list(int)
+961,remove empty lists,"([[True, False, False], [True, False], [True, True], [True, False, True]],)","[[True, False, False], [True, False], [True, True], [True, False, True]]",list(list(bool)) -> list(list(bool))
+962,max,"([13, 9, 16, 8],)",16,list(int) -> int
+963,slice-k-n with k=2 and n=1,"([11, 12, 4, 5, 2],)",[12],list(int) -> list(int)
+964,prepend-k with k=1,"([13, 13, 16, 13, 0, 14, 13],)","[1, 13, 13, 16, 13, 0, 14, 13]",list(int) -> list(int)
+965,len,"([],)",0,list(int) -> int
+966,rotate-k with k=3,"([4, 10, 7, 5, 7, 1, 2, 14, 10, 13],)","[14, 10, 13, 4, 10, 7, 5, 7, 1, 2]",list(int) -> list(int)
+967,remove-mod-k with k=4,"([0, 12],)",[],list(int) -> list(int)
+968,caesar-cipher-k-modulo-n with k=2 and n=4,"([1, 2],)","[3, 0]",list(int) -> list(int)
+969,prepend-k with k=5,"([10, 7, 15, 13, 14, 13, 3],)","[5, 10, 7, 15, 13, 14, 13, 3]",list(int) -> list(int)
+970,keep-mod-k with k=4,"([8, 14],)",[8],list(int) -> list(int)
+971,remove-mod-k with k=2,"([],)",[],list(int) -> list(int)
+972,last,"([1, 12, 4, 0, 0, 14, 14],)",14,list(int) -> int
+973,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 0, 1, 1, 1],)","[0, 2, 0, 0, 0]",list(int) -> list(int)
+974,has-k with k=2,"([1, 7, 3, 2, 3],)",True,list(int) -> bool
+975,bool-identify-geq-k with k=3,"([-1],)",[False],list(int) -> list(bool)
+976,take-k with k=3,"([6, 5, 11, 7],)","[6, 5, 11]",list(int) -> list(int)
+977,bool-identify-geq-k with k=5,"([12, 10, 6, 6, 12],)","[True, True, True, True, True]",list(int) -> list(bool)
+978,modulo-k with k=2,"([12, 15],)","[0, 1]",list(int) -> list(int)
+979,sort-and-deduplicate,"([7, 10, 5, 0],)","[0, 5, 7, 10]",list(int) -> list(int)
+980,range +1 maximum list,"([5, 5, 8, 0, 7],)","[0, 1, 2, 3, 4, 5, 6, 7, 8]",list(int) -> list(int)
+981,rotate-k with k=5,"([14, 6, 10, 2, 7, 12, 1, 12, 8, 11, 2, 7, 3],)","[8, 11, 2, 7, 3, 14, 6, 10, 2, 7, 12, 1, 12]",list(int) -> list(int)
+982,kth-largest with k=4,"([7, 14, 14, 11, 8, 14, 3, 8, 6, 1],)",11,list(int) -> int
+983,kth-smallest with k=4,"([4, 9, 11, 5, 11, 1],)",9,list(int) -> int
+984,slice-k-n with k=1 and n=5,"([7, 11, 5, 14, 15, 11, 12, 9, 7, 5],)","[7, 11, 5, 14, 15]",list(int) -> list(int)
+985,evens,"([14, 7, 3, 1, 9, 9, 5],)",[14],list(int) -> list(int)
+986,has-k with k=0,"([],)",False,list(int) -> bool
+987,modulo-k with k=3,"([],)",[],list(int) -> list(int)
+988,kth-smallest with k=5,"([7, 11, 5, 11, 16, 6, 0, 0, 8],)",7,list(int) -> int
+989,is-primes,"([67, 179, 17, 163, 79],)",True,list(int) -> bool
+990,modulo-k with k=4,"([6],)",[2],list(int) -> list(int)
+991,prepend-k with k=2,"([10, 0],)","[2, 10, 0]",list(int) -> list(int)
+992,replace-all-with-index-k with k=2,"([3, 7, 10, 11, 7],)","[7, 7, 7, 7, 7]",list(int) -> list(int)
+993,bool-identify-geq-k with k=1,"([],)",[],list(int) -> list(bool)
+994,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 0, 0, 2, 0, 1],)","[2, 1, 1, 0, 1, 2]",list(int) -> list(int)
+995,slice-k-n with k=2 and n=5,"([14, 4, 13, 11, 12, 10, 12, 3, 1, 10, 15, 7],)","[4, 13, 11, 12, 10]",list(int) -> list(int)
+996,modulo-k with k=5,"([15],)",[0],list(int) -> list(int)
+997,slice-k-n with k=5 and n=4,"([8, 3, 6, 2, 1, 10, 1, 13, 7, 6, 3, 8, 11, 11, 8, 10, 8],)","[1, 10, 1, 13]",list(int) -> list(int)
+998,drop-k with k=4,"([7, 14, 14, 11, 8, 14, 3, 8, 6, 1],)","[8, 14, 3, 8, 6, 1]",list(int) -> list(int)
+999,empty,"([1, 1, 2, 1],)",False,list(int) -> bool
+1000,prepend-k with k=4,"([7, 16, 9, 16, 9],)","[4, 7, 16, 9, 16, 9]",list(int) -> list(int)
+1001,fibonacci,"(9,)",34,int -> int
+1002,add-k with k=2,"([5, 0],)","[7, 2]",list(int) -> list(int)
+1003,slice-k-n with k=3 and n=1,"([1, 13, 4, 0, 8, 4],)",[4],list(int) -> list(int)
+1004,repeat-k with k=5,"([11, 13, 11, 3, 1],)","[11, 13, 11, 3, 1, 11, 13, 11, 3, 1, 11, 13, 11, 3, 1, 11, 13, 11, 3, 1, 11, 13, 11, 3, 1]",list(int) -> list(int)
+1005,bool-identify-is-prime,"([5, 14, 10, 15, 6],)","[True, False, False, False, False]",list(int) -> list(bool)
+1006,remove-mod-k with k=2,"([0],)",[],list(int) -> list(int)
+1007,bool-identify-k with k=2,"([2, 15],)","[True, False]",list(int) -> list(bool)
+1008,remove gt 3,"([5, 0, 6, 6, 3],)","[0, 3]",list(int) -> list(int)
+1009,head,"([0],)",0,list(int) -> int
+1010,count-k with k=3,"([],)",0,list(int) -> int
+1011,remove eq 1,"([6, 0, 3, 3, 2],)","[6, 0, 3, 3, 2]",list(int) -> list(int)
+1012,remove empty lists,"([[False, True, True], [False], [True, True], [True, True]],)","[[False, True, True], [False], [True, True], [True, True]]",list(list(bool)) -> list(list(bool))
+1013,kth-smallest with k=2,"([2, 16, 6, 4, 4, 1, 5],)",2,list(int) -> int
+1014,prepend-k with k=3,"([0, 2, 11, 9, 3],)","[3, 0, 2, 11, 9, 3]",list(int) -> list(int)
+1015,pop,"([6, 8, 1, 3, 0],)","[6, 8, 1, 3]",list(int) -> list(int)
+1016,slice-k-n with k=3 and n=5,"([14, 7, 14, 14, 0, 8, 10, 4, 1, 9, 0, 9, 4],)","[14, 14, 0, 8, 10]",list(int) -> list(int)
+1017,max,"([4, 9],)",9,list(int) -> int
+1018,rotate-k with k=5,"([11, 3, 6, 7, 6, 8, 5, 6, 10, 3, 14, 4, 3, 8, 13],)","[14, 4, 3, 8, 13, 11, 3, 6, 7, 6, 8, 5, 6, 10, 3]",list(int) -> list(int)
+1019,has-k with k=5,"([13, 7, 9, 10],)",False,list(int) -> bool
+1020,repeat-k with k=2,"([13, 6],)","[13, 6, 13, 6]",list(int) -> list(int)
+1021,count-k with k=2,"([2],)",1,list(int) -> int
+1022,head,"([8, 7],)",8,list(int) -> int
+1023,product,"([7, 1, 6, 2],)",84,list(int) -> int
+1024,has-k with k=2,"([9, 15, 4, 7],)",False,list(int) -> bool
+1025,append-index-k with k=4,"([5, 11, 8, 5],)","[5, 11, 8, 5, 5]",list(int) -> list(int)
+1026,bool-identify-k with k=5,"([8, 14],)","[False, False]",list(int) -> list(bool)
+1027,take-k with k=4,"([10, 15, 5, 3, 4, 9, 6, 14, 6],)","[10, 15, 5, 3]",list(int) -> list(int)
+1028,drop-k with k=1,"([13, 2],)",[2],list(int) -> list(int)
+1029,caesar-cipher-k-modulo-n with k=3 and n=5,"([],)",[],list(int) -> list(int)
+1030,pop,"([8, 2, 2],)","[8, 2]",list(int) -> list(int)
+1031,keep squares,"([1, 4, 1, 9, 6, 4, 9],)","[1, 4, 1, 9, 4, 9]",list(int) -> list(int)
+1032,has-k with k=3,"([16, 6, 8, 13, 14],)",False,list(int) -> bool
+1033,slice-k-n with k=5 and n=2,"([0, 11, 16, 14, 7, 7, 11, 11, 4, 5, 15, 6],)","[7, 7]",list(int) -> list(int)
+1034,has-k with k=5,"([12],)",False,list(int) -> bool
+1035,bool-identify-is-mod-k with k=2,"([13, 2, 0, 1, 2],)","[False, True, True, False, True]",list(int) -> list(bool)
+1036,bool-identify-geq-k with k=0,"([5, 2, 5, 8, 2, 2],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+1037,bool-identify-geq-k with k=2,"([-1, -1, 6, 15],)","[False, False, True, True]",list(int) -> list(bool)
+1038,kth-largest with k=1,"([9, 9, 15],)",15,list(int) -> int
+1039,slice-k-n with k=5 and n=5,"([12, 15, 0, 13, 13, 9, 2, 11, 6, 7, 3, 3, 12, 10, 2, 10],)","[13, 9, 2, 11, 6]",list(int) -> list(int)
+1040,remove empty lists,"([[], [False, True, True], [True, False], [False]],)","[[False, True, True], [True, False], [False]]",list(list(bool)) -> list(list(bool))
+1041,reverse,"([4, 11],)","[11, 4]",list(int) -> list(int)
+1042,index-k with k=2,"([13, 2],)",2,list(int) -> int
+1043,evens,"([10, 11, 8, 16],)","[10, 8, 16]",list(int) -> list(int)
+1044,slice-k-n with k=1 and n=1,"([14, 1, 5, 9, 0, 15, 14, 9, 12, 13],)",[14],list(int) -> list(int)
+1045,kth-largest with k=2,"([13, 10, 5, 13, 5, 1],)",13,list(int) -> int
+1046,prepend-index-k with k=2,"([7, 12],)","[12, 7, 12]",list(int) -> list(int)
+1047,keep eq 0,"([4, 3, 2, 1, 5],)",[],list(int) -> list(int)
+1048,add-k with k=3,"([9, 2, 11, 4, 13, 11],)","[12, 5, 14, 7, 16, 14]",list(int) -> list(int)
+1049,len,"([5, 6, 2, 8, 9],)",5,list(int) -> int
+1050,kth-largest with k=5,"([2, 9, 16, 2, 7, 12],)",2,list(int) -> int
+1051,slice-k-n with k=5 and n=1,"([2, 11, 14, 5, 8, 11, 7],)",[8],list(int) -> list(int)
+1052,mult-k with k=4,"([2],)",[8],list(int) -> list(int)
+1053,slice-k-n with k=3 and n=2,"([1, 0, 11, 10, 7, 15, 3],)","[11, 10]",list(int) -> list(int)
+1054,keep-mod-k with k=3,"([3, 4, 13, 10, 0],)","[3, 0]",list(int) -> list(int)
+1055,mult-k with k=2,"([2, 0, 15, 0, 2],)","[4, 0, 30, 0, 4]",list(int) -> list(int)
+1056,max,"([15, 14, 11, 7, 12, 0, 15],)",15,list(int) -> int
+1057,is-primes,"([13, 14],)",False,list(int) -> bool
+1058,bool-identify-k with k=4,"([2, 7, 12],)","[False, False, False]",list(int) -> list(bool)
+1059,kth-smallest with k=1,"([14],)",14,list(int) -> int
+1060,has-k with k=0,"([6, 11, 0, 11],)",True,list(int) -> bool
+1061,take-k with k=2,"([14, 2, 11, 4, 1, 6, 11, 4, 1],)","[14, 2]",list(int) -> list(int)
+1062,mult-k with k=5,"([8, 13],)","[40, 65]",list(int) -> list(int)
+1063,remove eq 2,"([2, 6, 0, 1, 0],)","[6, 0, 1, 0]",list(int) -> list(int)
+1064,remove eq 0,"([4, 4, 3, 5, 2],)","[4, 4, 3, 5, 2]",list(int) -> list(int)
+1065,slice-k-n with k=2 and n=5,"([4, 14, 6, 13, 10, 6, 12, 8, 11, 14],)","[14, 6, 13, 10, 6]",list(int) -> list(int)
+1066,is-mod-k with k=1,"([14, 1],)",True,list(int) -> bool
+1067,append-index-k with k=1,"([11, 7, 6, 4, 9, 4, 15, 16],)","[11, 7, 6, 4, 9, 4, 15, 16, 11]",list(int) -> list(int)
+1068,keep eq 1,"([2, 6, 4, 0, 6],)",[],list(int) -> list(int)
+1069,bool-identify-k with k=2,"([2, 2, 2, 2, 16, 2],)","[True, True, True, True, False, True]",list(int) -> list(bool)
+1070,has-k with k=4,"([4],)",True,list(int) -> bool
+1071,rotate-k with k=3,"([6, 0, 10, 14, 5, 13, 11, 2, 7, 7, 12],)","[7, 7, 12, 6, 0, 10, 14, 5, 13, 11, 2]",list(int) -> list(int)
+1072,add-k with k=2,"([11, 6, 0, 3],)","[13, 8, 2, 5]",list(int) -> list(int)
+1073,keep-mod-head,"([7, 13],)",[],list(int) -> list(int)
+1074,kth-largest with k=1,"([6, 8, 8, 1, 9],)",9,list(int) -> int
+1075,index-k with k=2,"([11, 7, 12, 5],)",7,list(int) -> int
+1076,append-k with k=5,"([],)",[5],list(int) -> list(int)
+1077,keep squares,"([9, 16, 1, 6, 16, 25, 2],)","[9, 16, 1, 16, 25]",list(int) -> list(int)
+1078,append-k with k=2,"([5],)","[5, 2]",list(int) -> list(int)
+1079,slice-k-n with k=4 and n=5,"([3, 0, 1, 14, 6, 10, 10, 12, 6, 0, 1, 9, 6, 7],)","[14, 6, 10, 10, 12]",list(int) -> list(int)
+1080,slice-k-n with k=3 and n=2,"([6, 6, 7, 8, 14, 7, 11, 14, 8, 16, 1, 8],)","[7, 8]",list(int) -> list(int)
+1081,add-k with k=1,"([9, 10, 4],)","[10, 11, 5]",list(int) -> list(int)
+1082,caesar-cipher-k-modulo-n with k=3 and n=4,"([0],)",[3],list(int) -> list(int)
+1083,remove-index-k with k=4,"([4, 9, 11, 5, 11, 1],)","[4, 9, 11, 11, 1]",list(int) -> list(int)
+1084,keep-mod-k with k=5,"([0, 25, 6],)","[0, 25]",list(int) -> list(int)
+1085,remove eq 0,"([4, 2, 0, 0, 3],)","[4, 2, 3]",list(int) -> list(int)
+1086,caesar-cipher-k-modulo-n with k=1 and n=5,"([1],)",[2],list(int) -> list(int)
+1087,index-k with k=2,"([8, 13, 4, 4, 12, 7],)",13,list(int) -> int
+1088,append-k with k=4,"([10, 15, 13, 8, 14, 10],)","[10, 15, 13, 8, 14, 10, 4]",list(int) -> list(int)
+1089,keep eq 3,"([4, 2, 3, 1, 5],)",[3],list(int) -> list(int)
+1090,tail,"([1, 7, 4, 5, 3],)","[7, 4, 5, 3]",list(int) -> list(int)
+1091,append-k with k=0,"([8, 10, 0],)","[8, 10, 0, 0]",list(int) -> list(int)
+1092,slice-k-n with k=2 and n=1,"([13, 15, 13, 6, 16, 2],)",[15],list(int) -> list(int)
+1093,caesar-cipher-k-modulo-n with k=1 and n=4,"([1, 3, 0],)","[2, 0, 1]",list(int) -> list(int)
+1094,index-k with k=5,"([0, 8, 9, 6, 7, 13, 8, 13, 16, 7, 10, 10],)",7,list(int) -> int
+1095,remove-mod-head,"([5, 6, 16, 11, 8, 8, 5],)","[6, 16, 11, 8, 8]",list(int) -> list(int)
+1096,keep eq 1,"([6, 6, 1, 1, 6],)","[1, 1]",list(int) -> list(int)
+1097,repeat-k with k=4,"([12, 3, 13],)","[12, 3, 13, 12, 3, 13, 12, 3, 13, 12, 3, 13]",list(int) -> list(int)
+1098,remove eq 1,"([4, 0, 0, 1, 6],)","[4, 0, 0, 6]",list(int) -> list(int)
+1099,is-odds,"([2, 5, 4, 2, 0, 5, 1, 1],)",False,list(int) -> bool
+1100,bool-identify-k with k=4,"([4],)",[True],list(int) -> list(bool)
+1101,repeat-many,"([4, 1, 2],)","[1, 2, 1, 2, 1, 2, 1, 2]",list(int) -> list(int)
+1102,pop,"([9],)",[],list(int) -> list(int)
+1103,keep-mod-k with k=3,"([0, 6, 9, 4, 16],)","[0, 6, 9]",list(int) -> list(int)
+1104,keep gt 0,"([5, 1, 1, 0, 1],)","[5, 1, 1, 1]",list(int) -> list(int)
+1105,slice-k-n with k=3 and n=1,"([12, 4, 7, 0, 3, 9, 10, 5, 0, 10, 10, 14],)",[7],list(int) -> list(int)
+1106,mult-k with k=0,"([15, 10],)","[0, 0]",list(int) -> list(int)
+1107,repeat-k with k=5,"([7, 9, 7, 7],)","[7, 9, 7, 7, 7, 9, 7, 7, 7, 9, 7, 7, 7, 9, 7, 7, 7, 9, 7, 7]",list(int) -> list(int)
+1108,caesar-cipher-k-modulo-n with k=4 and n=3,"([],)",[],list(int) -> list(int)
+1109,has-k with k=0,"([],)",False,list(int) -> bool
+1110,slice-k-n with k=4 and n=5,"([14, 14, 8, 2, 4, 8, 10, 9, 12, 11, 10],)","[2, 4, 8, 10, 9]",list(int) -> list(int)
+1111,pow-k with k=3,"([1, 16, 5, 15, 8, 10, 13],)","[1, 4096, 125, 3375, 512, 1000, 2197]",list(int) -> list(int)
+1112,index-k with k=3,"([5, 6, 0, 9, 6, 7, 15],)",0,list(int) -> int
+1113,bool-identify-k with k=3,"([2, 13],)","[False, False]",list(int) -> list(bool)
+1114,remove-mod-k with k=3,"([11, 9, 10, 15, 0, 1, 13],)","[11, 10, 1, 13]",list(int) -> list(int)
+1115,repeat,"([1, 1],)",[1],list(int) -> list(int)
+1116,sum,"([13, 15, 13],)",41,list(int) -> int
+1117,caesar-cipher-k-modulo-n with k=3 and n=5,"([],)",[],list(int) -> list(int)
+1118,prepend-index-k with k=5,"([2, 5, 12, 15, 10, 13],)","[10, 2, 5, 12, 15, 10, 13]",list(int) -> list(int)
+1119,bool-identify-geq-k with k=0,"([12, 2, 7, 1, 6],)","[True, True, True, True, True]",list(int) -> list(bool)
+1120,drop-k with k=1,"([11, 2, 10, 10],)","[2, 10, 10]",list(int) -> list(int)
+1121,is-mod-k with k=2,"([],)",True,list(int) -> bool
+1122,append-k with k=3,"([12, 15, 12],)","[12, 15, 12, 3]",list(int) -> list(int)
+1123,kth-largest with k=1,"([8],)",8,list(int) -> int
+1124,remove gt 1,"([6, 1, 5, 4, 5],)",[1],list(int) -> list(int)
+1125,has-head-in-tail,"([2, 1, 2],)",True,list(int) -> bool
+1126,bool-identify-geq-k with k=4,"([12, 13],)","[True, True]",list(int) -> list(bool)
+1127,keep-mod-k with k=5,"([5, 2, 7, 11, 13],)",[5],list(int) -> list(int)
+1128,prepend-k with k=2,"([],)",[2],list(int) -> list(int)
+1129,slice-k-n with k=2 and n=2,"([13, 12, 8, 12, 8],)","[12, 8]",list(int) -> list(int)
+1130,mult-k with k=3,"([12, 7, 7],)","[36, 21, 21]",list(int) -> list(int)
+1131,remove eq 2,"([2, 3, 2, 3, 4],)","[3, 3, 4]",list(int) -> list(int)
+1132,is-odds,"([21, 9, 33],)",True,list(int) -> bool
+1133,slice-k-n with k=2 and n=2,"([12, 6, 14, 6, 7, 8, 6, 6, 13, 7, 6, 10],)","[6, 14]",list(int) -> list(int)
+1134,prepend-k with k=5,"([7, 15, 1, 15, 16, 7, 10],)","[5, 7, 15, 1, 15, 16, 7, 10]",list(int) -> list(int)
+1135,prepend-k with k=2,"([],)",[2],list(int) -> list(int)
+1136,slice-k-n with k=3 and n=2,"([11, 0, 13, 11, 9, 7, 7, 10, 9, 2],)","[13, 11]",list(int) -> list(int)
+1137,fibonacci,"(8,)",21,int -> int
+1138,slice-k-n with k=3 and n=2,"([10, 13, 7, 13, 2, 8],)","[7, 13]",list(int) -> list(int)
+1139,remove-index-k with k=4,"([2, 1, 12, 15],)","[2, 1, 12]",list(int) -> list(int)
+1140,bool-identify-k with k=0,"([],)",[],list(int) -> list(bool)
+1141,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 0, 0, 1, 0, 0],)","[0, 1, 1, 0, 1, 1]",list(int) -> list(int)
+1142,caesar-cipher-k-modulo-n with k=3 and n=4,"([1, 1, 3, 1],)","[0, 0, 2, 0]",list(int) -> list(int)
+1143,append-k with k=1,"([5, 0, 1, 16, 14, 12],)","[5, 0, 1, 16, 14, 12, 1]",list(int) -> list(int)
+1144,caesar-cipher-k-modulo-n with k=5 and n=4,"([0, 0],)","[1, 1]",list(int) -> list(int)
+1145,slice-k-n with k=4 and n=4,"([15, 5, 1, 4, 11, 7, 8, 15, 3, 1, 7, 1, 3, 8, 4, 14],)","[4, 11, 7, 8]",list(int) -> list(int)
+1146,is-primes,"([2, 0],)",False,list(int) -> bool
+1147,caesar-cipher-k-modulo-n with k=3 and n=4,"([0],)",[3],list(int) -> list(int)
+1148,caesar-cipher-k-modulo-n with k=1 and n=3,"([0, 0],)","[1, 1]",list(int) -> list(int)
+1149,bool-identify-geq-k with k=1,"([2, 5, 11],)","[True, True, True]",list(int) -> list(bool)
+1150,is-mod-k with k=2,"([18, 24, 14, 22, 12, 28],)",True,list(int) -> bool
+1151,add-k with k=5,"([9, 6, 5, 0, 7, 7],)","[14, 11, 10, 5, 12, 12]",list(int) -> list(int)
+1152,index-k with k=5,"([15, 8, 9, 0, 11, 12, 9, 15],)",11,list(int) -> int
+1153,remove gt 3,"([6, 2, 4, 4, 0],)","[2, 0]",list(int) -> list(int)
+1154,prepend-index-k with k=1,"([0, 9, 3, 1, 2, 3, 11, 8],)","[0, 0, 9, 3, 1, 2, 3, 11, 8]",list(int) -> list(int)
+1155,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 0, 1, 1, 1],)","[2, 1, 2, 2, 2]",list(int) -> list(int)
+1156,prepend-k with k=2,"([14],)","[2, 14]",list(int) -> list(int)
+1157,add-k with k=3,"([11, 14, 7],)","[14, 17, 10]",list(int) -> list(int)
+1158,append-k with k=3,"([],)",[3],list(int) -> list(int)
+1159,head,"([9, 3],)",9,list(int) -> int
+1160,bool-identify-is-prime,"([7, 4, 11],)","[True, False, True]",list(int) -> list(bool)
+1161,is-mod-k with k=5,"([12, 8],)",False,list(int) -> bool
+1162,add-k with k=1,"([0, 11, 7, 9, 3],)","[1, 12, 8, 10, 4]",list(int) -> list(int)
+1163,rotate-k with k=2,"([10, 13, 9, 13],)","[9, 13, 10, 13]",list(int) -> list(int)
+1164,is-mod-k with k=2,"([22, 10, 14, 12, 16],)",True,list(int) -> bool
+1165,pow-k with k=4,"([1],)",[1],list(int) -> list(int)
+1166,repeat-k with k=2,"([15],)","[15, 15]",list(int) -> list(int)
+1167,keep eq 3,"([4, 1, 1, 5, 6],)",[],list(int) -> list(int)
+1168,prepend-index-k with k=5,"([3, 3, 7, 11, 3, 7, 2, 10, 7, 15],)","[3, 3, 3, 7, 11, 3, 7, 2, 10, 7, 15]",list(int) -> list(int)
+1169,has-k with k=3,"([13, 3, 5, 5, 13],)",True,list(int) -> bool
+1170,slice-k-n with k=2 and n=1,"([16, 15, 9, 11, 12],)",[15],list(int) -> list(int)
+1171,bool-identify-is-mod-k with k=2,"([12],)",[True],list(int) -> list(bool)
+1172,range,"(2,)","[0, 1]",int -> list(int)
+1173,caesar-cipher-k-modulo-n with k=2 and n=4,"([1, 2, 1, 3, 1],)","[3, 0, 3, 1, 3]",list(int) -> list(int)
+1174,add-k with k=4,"([3, 2, 8, 8, 7, 0, 9],)","[7, 6, 12, 12, 11, 4, 13]",list(int) -> list(int)
+1175,keep gt 0,"([5, 3, 4, 5, 6],)","[5, 3, 4, 5, 6]",list(int) -> list(int)
+1176,take-k with k=1,"([10, 13, 10, 5],)",[10],list(int) -> list(int)
+1177,remove-mod-k with k=5,"([35, 1, 4, 13, 10, 6, 35],)","[1, 4, 13, 6]",list(int) -> list(int)
+1178,remove gt 1,"([4, 4, 3, 5, 3],)",[],list(int) -> list(int)
+1179,slice-k-n with k=4 and n=1,"([13, 13, 12, 9, 14, 1, 12, 4, 14, 8, 8, 0, 1],)",[9],list(int) -> list(int)
+1180,count-k with k=0,"([10, 15],)",0,list(int) -> int
+1181,count-k with k=2,"([2, 2, 2, 2, 16, 2],)",5,list(int) -> int
+1182,append-index-k with k=4,"([1, 1, 10, 6, 6, 12, 0, 7, 13, 15, 16],)","[1, 1, 10, 6, 6, 12, 0, 7, 13, 15, 16, 6]",list(int) -> list(int)
+1183,kth-smallest with k=2,"([2, 2, 13, 0, 13, 5, 2, 6, 2],)",2,list(int) -> int
+1184,keep eq 1,"([3, 3, 2, 5, 3],)",[],list(int) -> list(int)
+1185,empty,"([],)",True,list(int) -> bool
+1186,slice-k-n with k=2 and n=4,"([13, 13, 4, 12, 3, 6, 5, 7, 13],)","[13, 4, 12, 3]",list(int) -> list(int)
+1187,mult-k with k=2,"([13, 14, 2, 8, 0, 14, 3],)","[26, 28, 4, 16, 0, 28, 6]",list(int) -> list(int)
+1188,slice-k-n with k=4 and n=2,"([6, 11, 12, 6, 11, 5, 0],)","[6, 11]",list(int) -> list(int)
+1189,kth-smallest with k=5,"([14, 6, 15, 10, 7, 8, 16, 16, 14],)",14,list(int) -> int
+1190,count-head-in-tail,"([12],)",0,list(int) -> int
+1191,is-mod-k with k=5,"([15, 4, 7, 9],)",False,list(int) -> bool
+1192,pow-k with k=5,"([14, 15],)","[537824, 759375]",list(int) -> list(int)
+1193,keep gt 3,"([1, 0, 3, 6, 4],)","[6, 4]",list(int) -> list(int)
+1194,repeat-k with k=3,"([1],)","[1, 1, 1]",list(int) -> list(int)
+1195,is-mod-k with k=2,"([22, 0, 0, 10],)",True,list(int) -> bool
+1196,slice-k-n with k=1 and n=5,"([5, 7, 4, 16, 10, 8, 12],)","[5, 7, 4, 16, 10]",list(int) -> list(int)
+1197,pow-k with k=5,"([9, 0, 3],)","[59049, 0, 243]",list(int) -> list(int)
+1198,is-squares,"([196, 49, 9, 1, 81, 81, 25],)",True,list(int) -> bool
+1199,take-k with k=5,"([7, 13, 0, 4, 14, 10, 10],)","[7, 13, 0, 4, 14]",list(int) -> list(int)
+1200,rotate-k with k=2,"([11, 16, 7, 7, 6, 3, 16, 12],)","[16, 12, 11, 16, 7, 7, 6, 3]",list(int) -> list(int)
+1201,slice-k-n with k=2 and n=5,"([15, 10, 2, 15, 16, 11, 16, 9, 13, 10, 1, 8, 14, 5],)","[10, 2, 15, 16, 11]",list(int) -> list(int)
+1202,remove gt 0,"([3, 1, 3, 1, 2],)",[],list(int) -> list(int)
+1203,keep gt 2,"([5, 0, 1, 5, 4],)","[5, 5, 4]",list(int) -> list(int)
+1204,slice-k-n with k=5 and n=2,"([4, 15, 6, 1, 4, 4, 11, 5, 15, 12],)","[4, 4]",list(int) -> list(int)
+1205,caesar-cipher-k-modulo-n with k=4 and n=5,"([4, 2, 2],)","[3, 1, 1]",list(int) -> list(int)
+1206,is-evens,"([11, 16, 10, 2, 1, 8],)",False,list(int) -> bool
+1207,is-squares,"([1, 4, 9, 15],)",False,list(int) -> bool
+1208,replace-all-with-index-k with k=2,"([1, 3, 5, 7, 5, 3, 3],)","[3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+1209,count-k with k=2,"([2, 2, 2, 2, 2, 2],)",6,list(int) -> int
+1210,take-k with k=5,"([5, 10, 13, 14, 6, 5, 13],)","[5, 10, 13, 14, 6]",list(int) -> list(int)
+1211,drop-k with k=4,"([4, 3, 8, 1, 14, 9, 6],)","[14, 9, 6]",list(int) -> list(int)
+1212,repeat-k with k=3,"([4],)","[4, 4, 4]",list(int) -> list(int)
+1213,slice-k-n with k=1 and n=4,"([5, 8, 11, 0, 0, 13, 3, 11, 1, 2, 12, 15, 5],)","[5, 8, 11, 0]",list(int) -> list(int)
+1214,index-k with k=5,"([13, 15, 6, 5, 2, 13, 14, 5, 12],)",2,list(int) -> int
+1215,bool-identify-k with k=2,"([14, 0, 2, 6],)","[False, False, True, False]",list(int) -> list(bool)
+1216,head,"([14, 8, 2, 12, 10],)",14,list(int) -> int
+1217,slice-k-n with k=4 and n=1,"([10, 10, 14, 13, 9, 8, 7, 13, 10, 12, 11, 4, 16],)",[13],list(int) -> list(int)
+1218,max,"([16, 10, 4, 9, 3],)",16,list(int) -> int
+1219,is-mod-k with k=5,"([16, 11, 14, 5],)",False,list(int) -> bool
+1220,count-k with k=5,"([8],)",0,list(int) -> int
+1221,bool-identify-k with k=2,"([2, 2, 2, 2, 2, 2, 2],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+1222,index-k with k=1,"([4, 1, 12, 0, 9, 12],)",4,list(int) -> int
+1223,modulo-k with k=5,"([5, 6, 0, 9],)","[0, 1, 0, 4]",list(int) -> list(int)
+1224,prepend-k with k=3,"([2, 5, 9, 14, 14],)","[3, 2, 5, 9, 14, 14]",list(int) -> list(int)
+1225,count-k with k=4,"([4, 13, 10, 4, 4, 4],)",4,list(int) -> int
+1226,drop-k with k=5,"([13, 1, 12, 11, 6, 11, 15, 11, 2, 7, 8],)","[11, 15, 11, 2, 7, 8]",list(int) -> list(int)
+1227,kth-smallest with k=4,"([7, 14, 8, 15, 8],)",14,list(int) -> int
+1228,pop,"([5, 11, 4, 14, 13, 8],)","[5, 11, 4, 14, 13]",list(int) -> list(int)
+1229,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 0, 1, 1, 1],)","[0, 1, 0, 0, 0]",list(int) -> list(int)
+1230,take-k with k=1,"([15, 12],)",[15],list(int) -> list(int)
+1231,remove-index-k with k=1,"([12, 15, 10, 10, 3, 8, 1],)","[15, 10, 10, 3, 8, 1]",list(int) -> list(int)
+1232,repeat-many,"([3, 3, 2, 5],)","[3, 2, 5, 3, 2, 5, 3, 2, 5]",list(int) -> list(int)
+1233,slice-k-n with k=4 and n=3,"([14, 15, 0, 16, 4, 11, 2, 13, 7, 5, 8],)","[16, 4, 11]",list(int) -> list(int)
+1234,repeat-k with k=5,"([6, 10, 14, 2],)","[6, 10, 14, 2, 6, 10, 14, 2, 6, 10, 14, 2, 6, 10, 14, 2, 6, 10, 14, 2]",list(int) -> list(int)
+1235,remove-index-k with k=5,"([3, 12, 15, 12, 1, 5, 15, 15, 2, 10],)","[3, 12, 15, 12, 5, 15, 15, 2, 10]",list(int) -> list(int)
+1236,kth-largest with k=4,"([5, 12, 2, 4, 15, 16],)",5,list(int) -> int
+1237,slice-k-n with k=2 and n=5,"([11, 3, 7, 16, 4, 8, 6, 7, 9, 3, 0, 5, 6],)","[3, 7, 16, 4, 8]",list(int) -> list(int)
+1238,mult-k with k=3,"([10, 8, 2, 12, 9, 11],)","[30, 24, 6, 36, 27, 33]",list(int) -> list(int)
+1239,replace-all-with-index-k with k=1,"([8, 1, 0, 8, 16, 11, 7],)","[8, 8, 8, 8, 8, 8, 8]",list(int) -> list(int)
+1240,keep eq 1,"([2, 4, 2, 6, 1],)",[1],list(int) -> list(int)
+1241,slice-k-n with k=5 and n=4,"([1, 4, 15, 3, 15, 8, 14, 5, 9, 4, 4, 2, 15, 7, 8],)","[15, 8, 14, 5]",list(int) -> list(int)
+1242,keep primes,"([23, 11, 23, 19, 2, 3, 8],)","[23, 11, 23, 19, 2, 3]",list(int) -> list(int)
+1243,rotate-k with k=3,"([0, 5, 4, 2, 14, 6],)","[2, 14, 6, 0, 5, 4]",list(int) -> list(int)
+1244,kth-largest with k=5,"([15, 16, 16, 16, 6, 0, 4, 7],)",7,list(int) -> int
+1245,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 1, 2, 1, 2, 2, 2],)","[2, 2, 0, 2, 0, 0, 0]",list(int) -> list(int)
+1246,rotate-k with k=3,"([13, 6, 15, 16, 4],)","[15, 16, 4, 13, 6]",list(int) -> list(int)
+1247,slice-k-n with k=4 and n=1,"([8, 13, 9, 1, 16, 0, 7, 5, 7, 11, 3, 2, 8],)",[1],list(int) -> list(int)
+1248,remove-index-k with k=2,"([15, 3, 10],)","[15, 10]",list(int) -> list(int)
+1249,bool-identify-geq-k with k=5,"([2, 15, 10, 15, 0],)","[False, True, True, True, False]",list(int) -> list(bool)
+1250,modulo-k with k=5,"([10],)",[0],list(int) -> list(int)
+1251,is-primes,"([5, 11, 12],)",False,list(int) -> bool
+1252,caesar-cipher-k-modulo-n with k=3 and n=4,"([0, 3, 1],)","[3, 2, 0]",list(int) -> list(int)
+1253,slice-k-n with k=1 and n=3,"([1, 14, 4, 2, 7, 14],)","[1, 14, 4]",list(int) -> list(int)
+1254,bool-identify-geq-k with k=3,"([7],)",[True],list(int) -> list(bool)
+1255,caesar-cipher-k-modulo-n with k=4 and n=5,"([4, 3, 2, 3, 3, 1],)","[3, 2, 1, 2, 2, 0]",list(int) -> list(int)
+1256,repeat,"([6, 13],)","[13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+1257,pow-k with k=5,"([10, 8],)","[100000, 32768]",list(int) -> list(int)
+1258,remove-mod-head,"([4, 2, 6, 10, 8, 12],)","[2, 6, 10]",list(int) -> list(int)
+1259,index-k with k=1,"([8, 1, 10, 4, 3],)",8,list(int) -> int
+1260,is-mod-k with k=1,"([2, 13, 3],)",True,list(int) -> bool
+1261,bool-identify-is-prime,"([2, 3, 4, 5, 7, 9],)","[True, True, False, True, True, False]",list(int) -> list(bool)
+1262,remove-mod-k with k=5,"([5, 40, 16],)",[16],list(int) -> list(int)
+1263,keep eq 1,"([0, 4, 1, 2, 4],)",[1],list(int) -> list(int)
+1264,prepend-k with k=1,"([9, 15, 2],)","[1, 9, 15, 2]",list(int) -> list(int)
+1265,count-k with k=3,"([12],)",0,list(int) -> int
+1266,count-k with k=1,"([1, 15],)",1,list(int) -> int
+1267,keep gt 1,"([3, 5, 3, 5, 4],)","[3, 5, 3, 5, 4]",list(int) -> list(int)
+1268,has-k with k=0,"([4, 9, 6, 11],)",False,list(int) -> bool
+1269,has-head-in-tail,"([4, 2, 6, 10, 8, 12],)",False,list(int) -> bool
+1270,keep eq 0,"([3, 3, 1, 6, 0],)",[0],list(int) -> list(int)
+1271,bool-identify-geq-k with k=3,"([5, 5, 7],)","[True, True, True]",list(int) -> list(bool)
+1272,slice-k-n with k=5 and n=1,"([16, 12, 11, 0, 0, 5, 10, 14],)",[0],list(int) -> list(int)
+1273,last,"([8, 4, 3, 13],)",13,list(int) -> int
+1274,keep eq 2,"([4, 2, 0, 1, 1],)",[2],list(int) -> list(int)
+1275,count-k with k=3,"([13, 7, 9, 10],)",0,list(int) -> int
+1276,keep eq 0,"([2, 1, 1, 1, 3],)",[],list(int) -> list(int)
+1277,kth-largest with k=3,"([1, 5, 8, 16, 15, 10, 14, 11],)",14,list(int) -> int
+1278,remove-index-k with k=3,"([4, 6, 12],)","[4, 6]",list(int) -> list(int)
+1279,mult-k with k=4,"([13, 15, 13],)","[52, 60, 52]",list(int) -> list(int)
+1280,prepend-k with k=2,"([12, 5, 15, 10, 6],)","[2, 12, 5, 15, 10, 6]",list(int) -> list(int)
+1281,caesar-cipher-k-modulo-n with k=2 and n=4,"([],)",[],list(int) -> list(int)
+1282,caesar-cipher-k-modulo-n with k=3 and n=5,"([1, 2],)","[4, 0]",list(int) -> list(int)
+1283,mult-k with k=2,"([],)",[],list(int) -> list(int)
+1284,modulo-k with k=4,"([0, 10, 4, 11],)","[0, 2, 0, 3]",list(int) -> list(int)
+1285,modulo-k with k=4,"([3, 8, 1, 11, 6],)","[3, 0, 1, 3, 2]",list(int) -> list(int)
+1286,min,"([3, 1, 8, 15, 7],)",1,list(int) -> int
+1287,keep-mod-head,"([1, 15],)",[15],list(int) -> list(int)
+1288,pow-k with k=5,"([12, 4, 8, 11, 0, 8, 11],)","[248832, 1024, 32768, 161051, 0, 32768, 161051]",list(int) -> list(int)
+1289,slice-k-n with k=3 and n=2,"([3, 12, 15, 13, 16, 3, 8, 11, 9, 16, 15, 4],)","[15, 13]",list(int) -> list(int)
+1290,prepend-index-k with k=1,"([3, 8, 6, 6, 11],)","[3, 3, 8, 6, 6, 11]",list(int) -> list(int)
+1291,bool-identify-geq-k with k=5,"([13],)",[True],list(int) -> list(bool)
+1292,caesar-cipher-k-modulo-n with k=3 and n=5,"([4, 2, 2, 0, 2],)","[2, 0, 0, 3, 0]",list(int) -> list(int)
+1293,take-k with k=5,"([12, 5, 3, 12, 4, 16, 8, 6, 2, 2],)","[12, 5, 3, 12, 4]",list(int) -> list(int)
+1294,prepend-index-k with k=4,"([13, 12, 8, 7, 11, 1, 15],)","[7, 13, 12, 8, 7, 11, 1, 15]",list(int) -> list(int)
+1295,remove gt 0,"([6, 0, 4, 6, 3],)",[0],list(int) -> list(int)
+1296,fibonacci,"(6,)",8,int -> int
+1297,rotate-k with k=5,"([6, 0, 7, 8, 15, 14, 0, 8, 16, 15, 9, 3, 7, 3, 9],)","[9, 3, 7, 3, 9, 6, 0, 7, 8, 15, 14, 0, 8, 16, 15]",list(int) -> list(int)
+1298,keep-mod-k with k=2,"([],)",[],list(int) -> list(int)
+1299,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 0, 1, 1],)","[0, 2, 0, 0]",list(int) -> list(int)
+1300,take-k with k=5,"([10, 5, 1, 13, 10, 8, 9, 10, 13, 7, 5],)","[10, 5, 1, 13, 10]",list(int) -> list(int)
+1301,slice-k-n with k=4 and n=1,"([9, 16, 10, 5, 14, 0, 1, 4],)",[5],list(int) -> list(int)
+1302,replace-all-with-index-k with k=1,"([0, 15],)","[0, 0]",list(int) -> list(int)
+1303,count-k with k=1,"([6, 1, 1, 1],)",3,list(int) -> int
+1304,remove-index-k with k=3,"([7, 1, 2, 14, 10],)","[7, 1, 14, 10]",list(int) -> list(int)
+1305,range +1 maximum list,"([8, 8, 0, 10],)","[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]",list(int) -> list(int)
+1306,remove-mod-k with k=2,"([1, 15, 5],)","[1, 15, 5]",list(int) -> list(int)
+1307,slice-k-n with k=1 and n=2,"([9, 9, 13, 7, 1],)","[9, 9]",list(int) -> list(int)
+1308,repeat,"([4, 5],)","[5, 5, 5, 5]",list(int) -> list(int)
+1309,bool-identify-k with k=1,"([1, 16, 1],)","[True, False, True]",list(int) -> list(bool)
+1310,prepend-index-k with k=5,"([4, 11, 12, 7, 2, 1, 15, 16],)","[2, 4, 11, 12, 7, 2, 1, 15, 16]",list(int) -> list(int)
+1311,slice-k-n with k=3 and n=3,"([3, 3, 16, 13, 4, 15, 14],)","[16, 13, 4]",list(int) -> list(int)
+1312,bool-identify-k with k=3,"([],)",[],list(int) -> list(bool)
+1313,take-k with k=4,"([7, 7, 12, 5],)","[7, 7, 12, 5]",list(int) -> list(int)
+1314,remove-mod-k with k=3,"([3],)",[],list(int) -> list(int)
+1315,head,"([16],)",16,list(int) -> int
+1316,keep gt 2,"([3, 2, 5, 2, 2],)","[3, 5]",list(int) -> list(int)
+1317,count-k with k=2,"([2, 2],)",2,list(int) -> int
+1318,pow-k with k=5,"([13, 4, 11, 10],)","[371293, 1024, 161051, 100000]",list(int) -> list(int)
+1319,bool-identify-k with k=2,"([2, 2],)","[True, True]",list(int) -> list(bool)
+1320,count-k with k=5,"([11, 12, 7],)",0,list(int) -> int
+1321,caesar-cipher-k-modulo-n with k=5 and n=2,"([1],)",[0],list(int) -> list(int)
+1322,dup,"([],)",[],list(int) -> list(int)
+1323,drop-k with k=1,"([16, 2, 1, 12, 1, 11, 15],)","[2, 1, 12, 1, 11, 15]",list(int) -> list(int)
+1324,is-mod-k with k=4,"([3, 5, 15, 16, 13],)",False,list(int) -> bool
+1325,is-mod-k with k=4,"([24],)",True,list(int) -> bool
+1326,replace-all-with-index-k with k=2,"([4, 16, 6, 0, 5, 10],)","[16, 16, 16, 16, 16, 16]",list(int) -> list(int)
+1327,count-k with k=5,"([8, 14],)",0,list(int) -> int
+1328,count-k with k=0,"([3, 14, 15, 0],)",1,list(int) -> int
+1329,keep-mod-k with k=3,"([13, 3],)",[3],list(int) -> list(int)
+1330,remove-index-k with k=3,"([4, 0, 3, 4, 9, 2, 15, 4, 8, 5],)","[4, 0, 4, 9, 2, 15, 4, 8, 5]",list(int) -> list(int)
+1331,caesar-cipher-k-modulo-n with k=4 and n=5,"([0, 0, 2, 4, 0, 1, 0],)","[4, 4, 1, 3, 4, 0, 4]",list(int) -> list(int)
+1332,slice-k-n with k=1 and n=1,"([9, 9, 14, 10],)",[9],list(int) -> list(int)
+1333,remove gt 1,"([6, 1, 4, 2, 3],)",[1],list(int) -> list(int)
+1334,rotate-k with k=3,"([12, 16, 4, 8, 4, 0, 0, 16, 14, 7, 13, 4],)","[7, 13, 4, 12, 16, 4, 8, 4, 0, 0, 16, 14]",list(int) -> list(int)
+1335,sort,"([9, 3, 8],)","[3, 8, 9]",list(int) -> list(int)
+1336,is-mod-k with k=3,"([12],)",True,list(int) -> bool
+1337,remove eq 1,"([2, 2, 1, 2, 1],)","[2, 2, 2]",list(int) -> list(int)
+1338,has-k with k=5,"([10, 0, 15, 9, 13],)",False,list(int) -> bool
+1339,keep eq 2,"([3, 3, 5, 1, 1],)",[],list(int) -> list(int)
+1340,prepend-k with k=4,"([7, 11, 8, 13],)","[4, 7, 11, 8, 13]",list(int) -> list(int)
+1341,bool-identify-geq-k with k=2,"([15, 2, 13, 11, 5, 9, 4],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+1342,keep eq 0,"([3, 0, 6, 4, 3],)",[0],list(int) -> list(int)
+1343,prepend-index-k with k=3,"([9, 11, 15, 2],)","[15, 9, 11, 15, 2]",list(int) -> list(int)
+1344,bool-identify-geq-k with k=1,"([],)",[],list(int) -> list(bool)
+1345,slice-k-n with k=4 and n=4,"([12, 1, 5, 12, 7, 10, 5, 16, 10, 9, 3, 8, 15],)","[12, 7, 10, 5]",list(int) -> list(int)
+1346,caesar-cipher-k-modulo-n with k=3 and n=4,"([1, 2, 3, 3, 0, 1],)","[0, 1, 2, 2, 3, 0]",list(int) -> list(int)
+1347,modulo-k with k=2,"([12],)",[0],list(int) -> list(int)
+1348,has-k with k=4,"([4, 4, 13],)",True,list(int) -> bool
+1349,slice-k-n with k=2 and n=5,"([14, 1, 7, 10, 5, 11, 16, 8, 1, 1, 14, 16, 0, 14, 14],)","[1, 7, 10, 5, 11]",list(int) -> list(int)
+1350,+1 maximum list,"([1, 4, 9, 7, 6],)",10,list(int) -> int
+1351,bool-identify-k with k=5,"([9, 1, 16],)","[False, False, False]",list(int) -> list(bool)
+1352,slice-k-n with k=2 and n=5,"([12, 12, 10, 16, 5, 6, 9, 4, 1, 0, 13, 4, 15, 7],)","[12, 10, 16, 5, 6]",list(int) -> list(int)
+1353,keep-mod-head,"([6, 18],)",[18],list(int) -> list(int)
+1354,remove eq 0,"([4, 3, 5, 5, 1],)","[4, 3, 5, 5, 1]",list(int) -> list(int)
+1355,has-head-in-tail,"([0, 0, 0, 5, 0],)",True,list(int) -> bool
+1356,slice-k-n with k=1 and n=1,"([15, 11, 7, 8, 10, 16],)",[15],list(int) -> list(int)
+1357,drop-k with k=2,"([7, 3, 2, 8],)","[2, 8]",list(int) -> list(int)
+1358,sort-and-deduplicate,"([3, 6],)","[3, 6]",list(int) -> list(int)
+1359,caesar-cipher-k-modulo-n with k=1 and n=5,"([],)",[],list(int) -> list(int)
+1360,mult-k with k=3,"([],)",[],list(int) -> list(int)
+1361,repeat-many,"([2, 4, 4, 1, 5],)","[4, 4, 1, 5, 4, 4, 1, 5]",list(int) -> list(int)
+1362,count-k with k=1,"([1, 2, 9, 16],)",1,list(int) -> int
+1363,caesar-cipher-k-modulo-n with k=3 and n=2,"([],)",[],list(int) -> list(int)
+1364,prepend-index-k with k=5,"([11, 2, 5, 11, 1, 1, 9, 13, 4, 15],)","[1, 11, 2, 5, 11, 1, 1, 9, 13, 4, 15]",list(int) -> list(int)
+1365,range +1 maximum list,"([7, 1, 3, 2, 7],)","[0, 1, 2, 3, 4, 5, 6, 7]",list(int) -> list(int)
+1366,prepend-k with k=3,"([16, 4, 10, 12, 5, 11],)","[3, 16, 4, 10, 12, 5, 11]",list(int) -> list(int)
+1367,append-index-k with k=3,"([14, 2, 10, 6, 7, 9, 14, 2],)","[14, 2, 10, 6, 7, 9, 14, 2, 10]",list(int) -> list(int)
+1368,keep eq 2,"([2, 0, 1, 3, 5],)",[2],list(int) -> list(int)
+1369,prepend-k with k=2,"([],)",[2],list(int) -> list(int)
+1370,repeat-k with k=2,"([4, 16, 0, 8],)","[4, 16, 0, 8, 4, 16, 0, 8]",list(int) -> list(int)
+1371,kth-largest with k=5,"([4, 14, 0, 12, 7],)",0,list(int) -> int
+1372,len,"([15],)",1,list(int) -> int
+1373,count-k with k=4,"([15, 1, 2, 7, 5, 4, 0],)",1,list(int) -> int
+1374,keep gt 0,"([5, 3, 3, 3, 6],)","[5, 3, 3, 3, 6]",list(int) -> list(int)
+1375,append-index-k with k=4,"([3, 5, 4, 4, 2, 0, 1, 8],)","[3, 5, 4, 4, 2, 0, 1, 8, 4]",list(int) -> list(int)
+1376,take-k with k=1,"([4, 9, 4],)",[4],list(int) -> list(int)
+1377,slice-k-n with k=3 and n=3,"([8, 13, 13, 11, 6, 15, 7, 8, 5, 10, 1],)","[13, 11, 6]",list(int) -> list(int)
+1378,take-k with k=5,"([15, 13, 4, 5, 10, 15, 4, 4, 2, 2],)","[15, 13, 4, 5, 10]",list(int) -> list(int)
+1379,count-k with k=4,"([13, 4, 0, 1, 4],)",2,list(int) -> int
+1380,remove eq 2,"([4, 0, 2, 4, 0],)","[4, 0, 4, 0]",list(int) -> list(int)
+1381,keep eq 3,"([4, 4, 4, 2, 2],)",[],list(int) -> list(int)
+1382,mult-k with k=2,"([11, 15, 10],)","[22, 30, 20]",list(int) -> list(int)
+1383,prepend-index-k with k=2,"([1, 15],)","[15, 1, 15]",list(int) -> list(int)
+1384,prepend-index-k with k=3,"([5, 10, 5, 16],)","[5, 5, 10, 5, 16]",list(int) -> list(int)
+1385,kth-largest with k=3,"([13, 0, 5, 14, 1, 12, 1, 12, 5, 4],)",12,list(int) -> int
+1386,kth-largest with k=1,"([16, 2, 1, 12, 1, 11, 15],)",16,list(int) -> int
+1387,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 0, 0, 1, 1],)","[1, 1, 1, 0, 0]",list(int) -> list(int)
+1388,index-k with k=5,"([0, 4, 2, 11, 6, 4, 9, 11, 5, 11, 1, 0],)",6,list(int) -> int
+1389,keep gt 2,"([6, 2, 4, 3, 1],)","[6, 4, 3]",list(int) -> list(int)
+1390,bool-identify-k with k=3,"([3, 3, 3],)","[True, True, True]",list(int) -> list(bool)
+1391,slice-k-n with k=1 and n=2,"([13, 8, 5, 4],)","[13, 8]",list(int) -> list(int)
+1392,is-mod-k with k=4,"([56, 12, 56, 60],)",True,list(int) -> bool
+1393,sort-and-deduplicate,"([3, 0, 2],)","[0, 2, 3]",list(int) -> list(int)
+1394,remove gt 2,"([2, 1, 1, 4, 6],)","[2, 1, 1]",list(int) -> list(int)
+1395,prepend-k with k=4,"([12, 15, 12, 4],)","[4, 12, 15, 12, 4]",list(int) -> list(int)
+1396,modulo-k with k=5,"([2, 2, 13, 0, 13, 5, 2],)","[2, 2, 3, 0, 3, 0, 2]",list(int) -> list(int)
+1397,add-k with k=4,"([9, 10, 10],)","[13, 14, 14]",list(int) -> list(int)
+1398,append-index-k with k=4,"([0, 13, 3, 9, 14, 2, 1, 16, 7, 11, 7],)","[0, 13, 3, 9, 14, 2, 1, 16, 7, 11, 7, 9]",list(int) -> list(int)
+1399,prepend-k with k=0,"([16],)","[0, 16]",list(int) -> list(int)
+1400,caesar-cipher-k-modulo-n with k=4 and n=5,"([4, 3, 2, 4, 2],)","[3, 2, 1, 3, 1]",list(int) -> list(int)
+1401,bool-identify-k with k=5,"([4, 12, 3, 15, 5, 5],)","[False, False, False, False, True, True]",list(int) -> list(bool)
+1402,append-index-k with k=4,"([11, 12, 1, 15, 3, 12, 4, 5, 5, 4],)","[11, 12, 1, 15, 3, 12, 4, 5, 5, 4, 15]",list(int) -> list(int)
+1403,pow-k with k=2,"([],)",[],list(int) -> list(int)
+1404,slice-k-n with k=4 and n=2,"([12, 3, 6, 9, 13, 11, 0, 10, 5, 15, 4, 6, 6],)","[9, 13]",list(int) -> list(int)
+1405,caesar-cipher-k-modulo-n with k=2 and n=4,"([0, 1, 1, 2, 3],)","[2, 3, 3, 0, 1]",list(int) -> list(int)
+1406,drop-k with k=4,"([4, 8, 4, 5],)",[],list(int) -> list(int)
+1407,replace-all-with-index-k with k=4,"([10, 15, 6, 9, 2],)","[9, 9, 9, 9, 9]",list(int) -> list(int)
+1408,bool-identify-geq-k with k=2,"([0, -1],)","[False, False]",list(int) -> list(bool)
+1409,caesar-cipher-k-modulo-n with k=2 and n=3,"([2, 2, 1, 1, 2, 1, 0],)","[1, 1, 0, 0, 1, 0, 2]",list(int) -> list(int)
+1410,is-squares,"([],)",True,list(int) -> bool
+1411,count-k with k=4,"([4, 4, 4, 4, 4],)",5,list(int) -> int
+1412,keep gt 2,"([3, 6, 1, 5, 0],)","[3, 6, 5]",list(int) -> list(int)
+1413,append-index-k with k=1,"([3, 5, 0],)","[3, 5, 0, 3]",list(int) -> list(int)
+1414,append-k with k=5,"([0],)","[0, 5]",list(int) -> list(int)
+1415,append-k with k=3,"([10, 16],)","[10, 16, 3]",list(int) -> list(int)
+1416,index-head,"([4, 9, 7, 7, 3, 2],)",3,list(int) -> int
+1417,len,"([3],)",1,list(int) -> int
+1418,drop-k with k=3,"([7, 11, 12, 8, 15, 1, 9, 2],)","[8, 15, 1, 9, 2]",list(int) -> list(int)
+1419,remove eq 0,"([0, 3, 6, 1, 5],)","[3, 6, 1, 5]",list(int) -> list(int)
+1420,caesar-cipher-k-modulo-n with k=5 and n=3,"([2],)",[1],list(int) -> list(int)
+1421,sort-and-deduplicate,"([1, 7, 10],)","[1, 7, 10]",list(int) -> list(int)
+1422,append-index-k with k=3,"([11, 0, 12, 10, 15, 13],)","[11, 0, 12, 10, 15, 13, 12]",list(int) -> list(int)
+1423,bool-identify-is-mod-k with k=4,"([9, 1, 16],)","[False, False, True]",list(int) -> list(bool)
+1424,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 2, 1],)","[2, 0, 2]",list(int) -> list(int)
+1425,rotate-k with k=5,"([8, 1, 14, 9, 7, 11, 16, 0, 15, 1, 4, 12, 10],)","[15, 1, 4, 12, 10, 8, 1, 14, 9, 7, 11, 16, 0]",list(int) -> list(int)
+1426,add-k with k=1,"([3, 4, 4, 13, 6],)","[4, 5, 5, 14, 7]",list(int) -> list(int)
+1427,prepend-k with k=0,"([5],)","[0, 5]",list(int) -> list(int)
+1428,odds,"([15],)",[15],list(int) -> list(int)
+1429,mult-k with k=3,"([12, 14, 13, 5, 8, 8, 9],)","[36, 42, 39, 15, 24, 24, 27]",list(int) -> list(int)
+1430,len,"([0],)",1,list(int) -> int
+1431,keep gt 3,"([4, 6, 3, 0, 2],)","[4, 6]",list(int) -> list(int)
+1432,replace-all-with-index-k with k=4,"([4, 14, 0, 9, 15, 3, 7, 5, 14, 7],)","[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]",list(int) -> list(int)
+1433,slice-k-n with k=4 and n=4,"([4, 7, 13, 4, 7, 13, 5, 10, 8, 8, 11],)","[4, 7, 13, 5]",list(int) -> list(int)
+1434,bool-identify-geq-k with k=0,"([1, 14, 12, 8, 4, 3, 12],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+1435,keep-mod-k with k=3,"([3, 9, 3, 15, 10],)","[3, 9, 3, 15]",list(int) -> list(int)
+1436,slice-k-n with k=5 and n=4,"([0, 9, 12, 15, 16, 4, 2, 7, 8, 2, 0, 2],)","[16, 4, 2, 7]",list(int) -> list(int)
+1437,evens,"([14],)",[14],list(int) -> list(int)
+1438,has-k with k=2,"([0, 2],)",True,list(int) -> bool
+1439,slice-k-n with k=3 and n=2,"([11, 12, 7, 13, 16, 3, 9, 15, 1, 0, 3],)","[7, 13]",list(int) -> list(int)
+1440,append-k with k=3,"([7, 14, 9],)","[7, 14, 9, 3]",list(int) -> list(int)
+1441,mult-k with k=3,"([7, 10, 8, 8],)","[21, 30, 24, 24]",list(int) -> list(int)
+1442,remove-index-k with k=2,"([6, 8],)",[6],list(int) -> list(int)
+1443,remove empty lists,"([[False], [False, False, False], [True, True], [False, False, False]],)","[[False], [False, False, False], [True, True], [False, False, False]]",list(list(bool)) -> list(list(bool))
+1444,modulo-k with k=1,"([1, 16, 12],)","[0, 0, 0]",list(int) -> list(int)
+1445,repeat,"([3, 7],)","[7, 7, 7]",list(int) -> list(int)
+1446,+1 maximum list,"([9, 7, 8],)",10,list(int) -> int
+1447,bool-identify-k with k=1,"([1, 1, 1, 1],)","[True, True, True, True]",list(int) -> list(bool)
+1448,keep gt 0,"([0, 5, 2, 4, 6],)","[5, 2, 4, 6]",list(int) -> list(int)
+1449,slice-k-n with k=1 and n=5,"([7, 8, 2, 14, 6, 14, 5, 5],)","[7, 8, 2, 14, 6]",list(int) -> list(int)
+1450,add-k with k=1,"([4, 14, 1],)","[5, 15, 2]",list(int) -> list(int)
+1451,repeat-many,"([5, 1],)","[1, 1, 1, 1, 1]",list(int) -> list(int)
+1452,mult-k with k=0,"([3, 16],)","[0, 0]",list(int) -> list(int)
+1453,slice-k-n with k=2 and n=3,"([14, 11, 0, 1, 0, 12, 14, 10, 7],)","[11, 0, 1]",list(int) -> list(int)
+1454,caesar-cipher-k-modulo-n with k=4 and n=5,"([],)",[],list(int) -> list(int)
+1455,bool-identify-geq-k with k=3,"([4, 9],)","[True, True]",list(int) -> list(bool)
+1456,is-primes,"([5, 13, 7, 5],)",True,list(int) -> bool
+1457,remove gt 1,"([0, 1, 6, 4, 3],)","[0, 1]",list(int) -> list(int)
+1458,take-k with k=2,"([3, 5, 1, 15, 2, 14, 14, 1, 11],)","[3, 5]",list(int) -> list(int)
+1459,bool-identify-geq-k with k=0,"([-1, -1, 13],)","[False, False, True]",list(int) -> list(bool)
+1460,caesar-cipher-k-modulo-n with k=5 and n=4,"([3, 0, 0],)","[0, 1, 1]",list(int) -> list(int)
+1461,drop-k with k=3,"([9, 15, 11, 10, 4, 13],)","[10, 4, 13]",list(int) -> list(int)
+1462,take-k with k=2,"([15, 0, 16, 1, 2, 5],)","[15, 0]",list(int) -> list(int)
+1463,remove-index-k with k=2,"([3, 11],)",[3],list(int) -> list(int)
+1464,bool-identify-geq-k with k=5,"([],)",[],list(int) -> list(bool)
+1465,caesar-cipher-k-modulo-n with k=2 and n=5,"([1, 0, 2, 2, 2, 0, 2],)","[3, 2, 4, 4, 4, 2, 4]",list(int) -> list(int)
+1466,prepend-index-k with k=2,"([6, 5, 11, 12, 14],)","[5, 6, 5, 11, 12, 14]",list(int) -> list(int)
+1467,is-mod-k with k=1,"([1, 12, 3],)",True,list(int) -> bool
+1468,+1 maximum list,"([5, 3, 9, 6, 7],)",10,list(int) -> int
+1469,bool-identify-is-mod-k with k=3,"([2, 3, 16],)","[False, True, False]",list(int) -> list(bool)
+1470,prepend-k with k=2,"([],)",[2],list(int) -> list(int)
+1471,mult-k with k=3,"([7, 8, 4, 3, 7],)","[21, 24, 12, 9, 21]",list(int) -> list(int)
+1472,slice-k-n with k=4 and n=3,"([1, 8, 7, 8, 4, 3, 6, 1, 10, 8, 5, 0, 4, 12, 15],)","[8, 4, 3]",list(int) -> list(int)
+1473,keep gt 1,"([0, 5, 6, 4, 3],)","[5, 6, 4, 3]",list(int) -> list(int)
+1474,append-index-k with k=1,"([7, 5, 16, 3],)","[7, 5, 16, 3, 7]",list(int) -> list(int)
+1475,head,"([11, 10, 12, 13, 2, 15],)",11,list(int) -> int
+1476,prepend-index-k with k=1,"([6, 7, 16, 16, 6],)","[6, 6, 7, 16, 16, 6]",list(int) -> list(int)
+1477,bool-identify-is-mod-k with k=1,"([],)",[],list(int) -> list(bool)
+1478,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 0, 0, 0, 1, 0, 0],)","[0, 1, 1, 1, 0, 1, 1]",list(int) -> list(int)
+1479,is-mod-k with k=1,"([6, 0, 14, 0, 2, 12],)",True,list(int) -> bool
+1480,slice-k-n with k=5 and n=3,"([8, 12, 8, 14, 9, 16, 6, 3, 2, 0, 10, 14, 11, 10],)","[9, 16, 6]",list(int) -> list(int)
+1481,repeat-k with k=4,"([3, 1, 12, 6],)","[3, 1, 12, 6, 3, 1, 12, 6, 3, 1, 12, 6, 3, 1, 12, 6]",list(int) -> list(int)
+1482,index-k with k=1,"([13, 14, 7, 10, 9, 7],)",13,list(int) -> int
+1483,caesar-cipher-k-modulo-n with k=3 and n=5,"([0, 1, 3, 2, 4],)","[3, 4, 1, 0, 2]",list(int) -> list(int)
+1484,index-head,"([3, 6, 13, 4, 6],)",4,list(int) -> int
+1485,keep eq 2,"([3, 0, 5, 5, 3],)",[],list(int) -> list(int)
+1486,drop-k with k=5,"([5, 10, 1, 5, 6, 16, 12, 9, 2, 7, 13],)","[16, 12, 9, 2, 7, 13]",list(int) -> list(int)
+1487,remove eq 2,"([0, 6, 5, 2, 6],)","[0, 6, 5, 6]",list(int) -> list(int)
+1488,count-k with k=5,"([9, 1, 16],)",0,list(int) -> int
+1489,kth-largest with k=4,"([0, 3, 6, 10, 4, 3, 1],)",3,list(int) -> int
+1490,has-k with k=3,"([6, 3, 3, 3],)",True,list(int) -> bool
+1491,caesar-cipher-k-modulo-n with k=3 and n=2,"([],)",[],list(int) -> list(int)
+1492,append-index-k with k=5,"([12, 5, 6, 5, 15, 2, 10, 7, 7, 2, 13, 10],)","[12, 5, 6, 5, 15, 2, 10, 7, 7, 2, 13, 10, 15]",list(int) -> list(int)
+1493,is-evens,"([2, 0, 4],)",True,list(int) -> bool
+1494,slice-k-n with k=2 and n=5,"([9, 7, 2, 5, 0, 11, 10, 2, 1, 15, 16, 8],)","[7, 2, 5, 0, 11]",list(int) -> list(int)
+1495,pow-k with k=3,"([15, 0, 2, 7, 11, 13],)","[3375, 0, 8, 343, 1331, 2197]",list(int) -> list(int)
+1496,take-k with k=4,"([8, 9, 3, 11, 1],)","[8, 9, 3, 11]",list(int) -> list(int)
+1497,caesar-cipher-k-modulo-n with k=2 and n=5,"([2, 1, 2, 4],)","[4, 3, 4, 1]",list(int) -> list(int)
+1498,remove empty lists,"([[], [False, False], [True, True, True], []],)","[[False, False], [True, True, True]]",list(list(bool)) -> list(list(bool))
+1499,index-k with k=4,"([4, 0, 3, 4, 9, 2, 15, 4, 8, 5, 8],)",4,list(int) -> int
+1500,slice-k-n with k=5 and n=4,"([2, 3, 9, 15, 1, 14, 7, 13, 10, 12, 14, 1, 11, 5, 12],)","[1, 14, 7, 13]",list(int) -> list(int)
+1501,remove gt 0,"([3, 0, 5, 4, 5],)",[0],list(int) -> list(int)
+1502,add-k with k=4,"([3],)",[7],list(int) -> list(int)
+1503,keep gt 1,"([1, 1, 4, 0, 5],)","[4, 5]",list(int) -> list(int)
+1504,prepend-index-k with k=3,"([3, 15, 13, 1, 8, 13, 9, 6],)","[13, 3, 15, 13, 1, 8, 13, 9, 6]",list(int) -> list(int)
+1505,is-odds,"([31, 33, 19, 25, 31, 1, 5],)",True,list(int) -> bool
+1506,replace-all-with-index-k with k=1,"([15, 7, 0, 9, 9, 7, 10],)","[15, 15, 15, 15, 15, 15, 15]",list(int) -> list(int)
+1507,keep-mod-k with k=2,"([0, 8, 1, 15, 10],)","[0, 8, 10]",list(int) -> list(int)
+1508,has-k with k=1,"([1, 1, 1],)",True,list(int) -> bool
+1509,tail,"([6, 6, 3, 14],)","[6, 3, 14]",list(int) -> list(int)
+1510,count-k with k=2,"([13, 10, 9],)",0,list(int) -> int
+1511,prepend-k with k=4,"([12, 0, 9, 14, 11],)","[4, 12, 0, 9, 14, 11]",list(int) -> list(int)
+1512,bool-identify-geq-k with k=0,"([11, 11],)","[True, True]",list(int) -> list(bool)
+1513,keep-mod-k with k=5,"([11, 8, 16, 13],)",[],list(int) -> list(int)
+1514,remove-mod-k with k=4,"([12, 9, 4, 16, 6],)","[9, 6]",list(int) -> list(int)
+1515,append-k with k=4,"([7, 16, 14, 12, 2],)","[7, 16, 14, 12, 2, 4]",list(int) -> list(int)
+1516,has-k with k=3,"([3, 16, 3],)",True,list(int) -> bool
+1517,is-odds,"([2, 0, 4],)",False,list(int) -> bool
+1518,append-index-k with k=5,"([4, 6, 1, 7, 1, 13],)","[4, 6, 1, 7, 1, 13, 1]",list(int) -> list(int)
+1519,mult-k with k=3,"([0, 6, 9, 4, 16, 10, 12],)","[0, 18, 27, 12, 48, 30, 36]",list(int) -> list(int)
+1520,bool-identify-geq-k with k=4,"([5, 15, 2, 15, 1, 10, 5],)","[True, True, False, True, False, True, True]",list(int) -> list(bool)
+1521,add-k with k=2,"([2, 4, 3, 13, 13],)","[4, 6, 5, 15, 15]",list(int) -> list(int)
+1522,mult-k with k=3,"([15, 3],)","[45, 9]",list(int) -> list(int)
+1523,take-k with k=3,"([14, 6, 0, 9, 4, 13],)","[14, 6, 0]",list(int) -> list(int)
+1524,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 1, 0, 1, 0],)","[1, 0, 1, 0, 1]",list(int) -> list(int)
+1525,replace-all-with-index-k with k=4,"([0, 15, 16, 5],)","[5, 5, 5, 5]",list(int) -> list(int)
+1526,slice-k-n with k=4 and n=5,"([13, 8, 8, 16, 2, 3, 13, 1, 9, 9, 1, 16, 7, 11],)","[16, 2, 3, 13, 1]",list(int) -> list(int)
+1527,caesar-cipher-k-modulo-n with k=2 and n=4,"([],)",[],list(int) -> list(int)
+1528,slice-k-n with k=5 and n=3,"([7, 0, 11, 0, 13, 2, 10, 5, 10, 8],)","[13, 2, 10]",list(int) -> list(int)
+1529,slice-k-n with k=1 and n=2,"([6, 2, 13, 8],)","[6, 2]",list(int) -> list(int)
+1530,caesar-cipher-k-modulo-n with k=4 and n=3,"([],)",[],list(int) -> list(int)
+1531,count-k with k=2,"([2, 2, 2, 2, 2, 2, 2],)",7,list(int) -> int
+1532,drop-k with k=5,"([7, 15, 3, 15, 7, 7, 11],)","[7, 11]",list(int) -> list(int)
+1533,slice-k-n with k=4 and n=5,"([1, 12, 7, 12, 0, 14, 12, 14, 5, 12, 15, 12, 1, 12, 6],)","[12, 0, 14, 12, 14]",list(int) -> list(int)
+1534,bool-identify-geq-k with k=0,"([0, 5, 6, 15, 0, 13],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+1535,keep-mod-k with k=4,"([0],)",[0],list(int) -> list(int)
+1536,slice-k-n with k=2 and n=3,"([5, 11, 9, 0, 10, 16, 9, 5, 11],)","[11, 9, 0]",list(int) -> list(int)
+1537,slice-k-n with k=1 and n=1,"([9, 2, 11, 7],)",[9],list(int) -> list(int)
+1538,prepend-k with k=0,"([9, 10, 8],)","[0, 9, 10, 8]",list(int) -> list(int)
+1539,sort-and-deduplicate,"([5, 9],)","[5, 9]",list(int) -> list(int)
+1540,bool-identify-geq-k with k=1,"([4, 4, 4, 0, 7, 4],)","[True, True, True, False, True, True]",list(int) -> list(bool)
+1541,slice-k-n with k=1 and n=3,"([14, 13, 13, 2, 12, 5, 15, 3],)","[14, 13, 13]",list(int) -> list(int)
+1542,slice-k-n with k=5 and n=3,"([14, 7, 15, 6, 10, 9, 8, 11, 2, 11],)","[10, 9, 8]",list(int) -> list(int)
+1543,slice-k-n with k=2 and n=2,"([6, 1, 7, 11, 9, 4],)","[1, 7]",list(int) -> list(int)
+1544,kth-largest with k=3,"([4, 1, 11, 2, 3, 15, 2, 0, 12],)",11,list(int) -> int
+1545,pow-k with k=2,"([0],)",[0],list(int) -> list(int)
+1546,kth-largest with k=4,"([4, 3, 8, 1, 14, 9, 6],)",6,list(int) -> int
+1547,mult-k with k=3,"([2, 6, 10, 10, 8, 15, 16],)","[6, 18, 30, 30, 24, 45, 48]",list(int) -> list(int)
+1548,append-index-k with k=1,"([12],)","[12, 12]",list(int) -> list(int)
+1549,keep gt 0,"([5, 2, 4, 6, 3],)","[5, 2, 4, 6, 3]",list(int) -> list(int)
+1550,bool-identify-is-mod-k with k=3,"([16],)",[False],list(int) -> list(bool)
+1551,take-k with k=2,"([14, 14],)","[14, 14]",list(int) -> list(int)
+1552,add-k with k=5,"([5, 14, 10, 15, 6],)","[10, 19, 15, 20, 11]",list(int) -> list(int)
+1553,keep-mod-head,"([8, 24, 32],)","[24, 32]",list(int) -> list(int)
+1554,keep-mod-k with k=2,"([2, 12, 2],)","[2, 12, 2]",list(int) -> list(int)
+1555,mult-k with k=5,"([10, 11, 13, 1, 10],)","[50, 55, 65, 5, 50]",list(int) -> list(int)
+1556,remove gt 2,"([3, 6, 4, 4, 6],)",[],list(int) -> list(int)
+1557,keep-mod-k with k=5,"([7, 5],)",[5],list(int) -> list(int)
+1558,keep eq 3,"([1, 2, 1, 6, 3],)",[3],list(int) -> list(int)
+1559,repeat,"([2, 1],)","[1, 1]",list(int) -> list(int)
+1560,kth-largest with k=3,"([9, 12, 12, 2, 16, 1, 3, 4, 16],)",12,list(int) -> int
+1561,slice-k-n with k=5 and n=5,"([11, 6, 2, 10, 12, 4, 9, 5, 7, 10, 5],)","[12, 4, 9, 5, 7]",list(int) -> list(int)
+1562,pow-k with k=4,"([2, 0, 1, 11, 11, 10],)","[16, 0, 1, 14641, 14641, 10000]",list(int) -> list(int)
+1563,bool-identify-geq-k with k=0,"([1, 14, 0, 12, 14],)","[True, True, True, True, True]",list(int) -> list(bool)
+1564,slice-k-n with k=5 and n=1,"([6, 3, 16, 10, 7, 13, 3, 4],)",[7],list(int) -> list(int)
+1565,kth-largest with k=2,"([2, 12, 7, 12],)",12,list(int) -> int
+1566,slice-k-n with k=5 and n=4,"([7, 6, 5, 7, 13, 8, 11, 13, 3, 16, 12, 10, 6, 15, 11, 3, 4],)","[13, 8, 11, 13]",list(int) -> list(int)
+1567,fibonacci,"(9,)",34,int -> int
+1568,remove-mod-k with k=5,"([5],)",[],list(int) -> list(int)
+1569,caesar-cipher-k-modulo-n with k=4 and n=3,"([2, 2, 2, 1],)","[0, 0, 0, 2]",list(int) -> list(int)
+1570,slice-k-n with k=1 and n=4,"([12, 12, 2, 1, 10, 15, 3, 13, 9, 9, 16, 1, 5],)","[12, 12, 2, 1]",list(int) -> list(int)
+1571,remove-mod-head,"([4, 5, 11, 11],)","[5, 11, 11]",list(int) -> list(int)
+1572,drop-k with k=2,"([5, 16, 1, 6, 12, 5, 6, 10, 10],)","[1, 6, 12, 5, 6, 10, 10]",list(int) -> list(int)
+1573,odds,"([16],)",[],list(int) -> list(int)
+1574,bool-identify-k with k=0,"([0, 0, 0],)","[True, True, True]",list(int) -> list(bool)
+1575,caesar-cipher-k-modulo-n with k=3 and n=2,"([],)",[],list(int) -> list(int)
+1576,take-k with k=4,"([12, 3, 13, 16, 6, 4, 12, 2, 16, 12],)","[12, 3, 13, 16]",list(int) -> list(int)
+1577,bool-identify-k with k=0,"([3, 14, 15, 0],)","[False, False, False, True]",list(int) -> list(bool)
+1578,bool-identify-geq-k with k=2,"([14, -1, -1, -1, 1, -1],)","[True, False, False, False, False, False]",list(int) -> list(bool)
+1579,prepend-index-k with k=1,"([2, 1, 3, 2, 13, 7, 9],)","[2, 2, 1, 3, 2, 13, 7, 9]",list(int) -> list(int)
+1580,kth-largest with k=2,"([16, 15, 13, 0, 15],)",15,list(int) -> int
+1581,slice-k-n with k=2 and n=3,"([7, 4, 11, 13, 11, 16, 9, 4, 14, 13, 1, 2, 15],)","[4, 11, 13]",list(int) -> list(int)
+1582,sum,"([1, 2, 3],)",6,list(int) -> int
+1583,keep-mod-k with k=4,"([7, 3, 10, 14, 4],)",[4],list(int) -> list(int)
+1584,pow-k with k=2,"([16, 15, 1, 12, 4, 0, 0],)","[256, 225, 1, 144, 16, 0, 0]",list(int) -> list(int)
+1585,add-k with k=2,"([14, 13, 12, 6],)","[16, 15, 14, 8]",list(int) -> list(int)
+1586,prepend-k with k=4,"([13, 12],)","[4, 13, 12]",list(int) -> list(int)
+1587,caesar-cipher-k-modulo-n with k=3 and n=5,"([4, 0],)","[2, 3]",list(int) -> list(int)
+1588,append-k with k=4,"([14, 1, 8, 0, 5, 7],)","[14, 1, 8, 0, 5, 7, 4]",list(int) -> list(int)
+1589,is-evens,"([22, 2, 20],)",True,list(int) -> bool
+1590,has-k with k=5,"([],)",False,list(int) -> bool
+1591,slice-k-n with k=4 and n=5,"([1, 15, 7, 1, 16, 16, 6, 8, 9, 15, 14, 1, 12],)","[1, 16, 16, 6, 8]",list(int) -> list(int)
+1592,append-k with k=2,"([],)",[2],list(int) -> list(int)
+1593,remove-index-k with k=2,"([12, 5, 0, 10],)","[12, 0, 10]",list(int) -> list(int)
+1594,+1 maximum list,"([7, 9, 0, 4, 0],)",10,list(int) -> int
+1595,prepend-k with k=0,"([12, 0, 1, 9, 4],)","[0, 12, 0, 1, 9, 4]",list(int) -> list(int)
+1596,mult-k with k=2,"([0, 2, 0],)","[0, 4, 0]",list(int) -> list(int)
+1597,add-k with k=5,"([7, 7, 0],)","[12, 12, 5]",list(int) -> list(int)
+1598,keep eq 1,"([3, 6, 4, 0, 0],)",[],list(int) -> list(int)
+1599,drop-k with k=1,"([9, 9, 15],)","[9, 15]",list(int) -> list(int)
+1600,remove eq 3,"([0, 0, 0, 5, 0],)","[0, 0, 0, 5, 0]",list(int) -> list(int)
+1601,caesar-cipher-k-modulo-n with k=1 and n=5,"([],)",[],list(int) -> list(int)
+1602,reverse,"([8, 6, 9],)","[9, 6, 8]",list(int) -> list(int)
+1603,is-squares,"([2],)",False,list(int) -> bool
+1604,index-k with k=3,"([5, 12, 14, 13, 2, 3, 14, 5, 3],)",14,list(int) -> int
+1605,prepend-index-k with k=5,"([3, 7, 1, 14, 7, 1, 10, 4, 2, 6],)","[7, 3, 7, 1, 14, 7, 1, 10, 4, 2, 6]",list(int) -> list(int)
+1606,append-k with k=0,"([7, 7, 5],)","[7, 7, 5, 0]",list(int) -> list(int)
+1607,remove-mod-head,"([6, 36],)",[],list(int) -> list(int)
+1608,prepend-k with k=3,"([11, 14, 7],)","[3, 11, 14, 7]",list(int) -> list(int)
+1609,slice-k-n with k=3 and n=3,"([3, 9, 3, 2, 14, 6, 2, 8, 14],)","[3, 2, 14]",list(int) -> list(int)
+1610,slice-k-n with k=1 and n=2,"([13, 3, 9, 14, 15],)","[13, 3]",list(int) -> list(int)
+1611,repeat-k with k=4,"([14, 8, 6, 2, 6],)","[14, 8, 6, 2, 6, 14, 8, 6, 2, 6, 14, 8, 6, 2, 6, 14, 8, 6, 2, 6]",list(int) -> list(int)
+1612,prepend-index-k with k=1,"([7, 13, 15, 10, 10, 8],)","[7, 7, 13, 15, 10, 10, 8]",list(int) -> list(int)
+1613,prepend-index-k with k=3,"([15, 6, 14, 4, 12, 0, 15],)","[14, 15, 6, 14, 4, 12, 0, 15]",list(int) -> list(int)
+1614,range +1 maximum list,"([0, 3, 3, 4, 7],)","[0, 1, 2, 3, 4, 5, 6, 7]",list(int) -> list(int)
+1615,modulo-k with k=4,"([],)",[],list(int) -> list(int)
+1616,repeat-k with k=2,"([0, 4],)","[0, 4, 0, 4]",list(int) -> list(int)
+1617,has-k with k=4,"([11, 11, 4, 14, 6, 14, 0],)",True,list(int) -> bool
+1618,remove gt 3,"([1, 4, 3, 6, 5],)","[1, 3]",list(int) -> list(int)
+1619,rotate-k with k=5,"([4, 8, 5, 8, 6, 4, 16, 5, 11, 11, 14, 0, 4, 6],)","[11, 14, 0, 4, 6, 4, 8, 5, 8, 6, 4, 16, 5, 11]",list(int) -> list(int)
+1620,slice-k-n with k=4 and n=4,"([14, 14, 1, 1, 9, 14, 13, 2, 11, 3],)","[1, 9, 14, 13]",list(int) -> list(int)
+1621,has-k with k=2,"([12],)",False,list(int) -> bool
+1622,take-k with k=2,"([7, 16, 11, 2, 2, 5, 12, 2],)","[7, 16]",list(int) -> list(int)
+1623,remove-mod-k with k=5,"([13, 12, 10, 1, 15],)","[13, 12, 1]",list(int) -> list(int)
+1624,prepend-k with k=5,"([5, 9],)","[5, 5, 9]",list(int) -> list(int)
+1625,caesar-cipher-k-modulo-n with k=1 and n=5,"([1, 2, 4, 1, 0],)","[2, 3, 0, 2, 1]",list(int) -> list(int)
+1626,kth-smallest with k=1,"([6, 0],)",0,list(int) -> int
+1627,slice-k-n with k=1 and n=4,"([9, 6, 11, 4, 14, 7, 16, 7, 3],)","[9, 6, 11, 4]",list(int) -> list(int)
+1628,append-k with k=5,"([13, 3],)","[13, 3, 5]",list(int) -> list(int)
+1629,add-k with k=1,"([4, 12, 15],)","[5, 13, 16]",list(int) -> list(int)
+1630,append-k with k=0,"([6, 4, 9],)","[6, 4, 9, 0]",list(int) -> list(int)
+1631,replace-all-with-index-k with k=5,"([8, 7, 16, 9, 3, 15],)","[3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+1632,slice-k-n with k=5 and n=5,"([5, 0, 6, 7, 6, 2, 8, 6, 13, 3, 6],)","[6, 2, 8, 6, 13]",list(int) -> list(int)
+1633,drop-k with k=4,"([5, 11, 5, 6, 7, 1, 3, 9, 14, 8],)","[7, 1, 3, 9, 14, 8]",list(int) -> list(int)
+1634,remove gt 2,"([5, 4, 2, 6, 6],)",[2],list(int) -> list(int)
+1635,reverse,"([],)",[],list(int) -> list(int)
+1636,modulo-k with k=3,"([14, 13, 8, 15, 8, 10, 0],)","[2, 1, 2, 0, 2, 1, 0]",list(int) -> list(int)
+1637,kth-smallest with k=1,"([12, 15, 10, 10, 3, 8, 1],)",1,list(int) -> int
+1638,slice-k-n with k=3 and n=1,"([10, 13, 5, 8, 16, 1, 4],)",[5],list(int) -> list(int)
+1639,bool-identify-k with k=1,"([15, 16],)","[False, False]",list(int) -> list(bool)
+1640,slice-k-n with k=3 and n=5,"([11, 1, 2, 6, 9, 7, 13, 2, 3, 16, 8],)","[2, 6, 9, 7, 13]",list(int) -> list(int)
+1641,append-index-k with k=1,"([10],)","[10, 10]",list(int) -> list(int)
+1642,slice-k-n with k=3 and n=4,"([8, 7, 16, 2, 13, 8, 14, 14, 15, 9, 8, 9, 1],)","[16, 2, 13, 8]",list(int) -> list(int)
+1643,slice-k-n with k=5 and n=1,"([15, 11, 4, 16, 12, 5, 4, 3, 7, 10, 16, 16, 11, 7],)",[12],list(int) -> list(int)
+1644,bool-identify-is-mod-k with k=1,"([11, 0, 1, 1, 1, 1, 1],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+1645,bool-identify-k with k=5,"([16],)",[False],list(int) -> list(bool)
+1646,len,"([],)",0,list(int) -> int
+1647,count-k with k=4,"([4, 16, 10],)",1,list(int) -> int
+1648,replace-all-with-index-k with k=3,"([7, 15, 15, 7],)","[15, 15, 15, 15]",list(int) -> list(int)
+1649,add-k with k=3,"([],)",[],list(int) -> list(int)
+1650,bool-identify-k with k=4,"([],)",[],list(int) -> list(bool)
+1651,slice-k-n with k=4 and n=1,"([7, 8, 3, 14, 10, 10],)",[14],list(int) -> list(int)
+1652,keep eq 1,"([3, 0, 4, 5, 2],)",[],list(int) -> list(int)
+1653,product,"([1, 1, 2, 1],)",2,list(int) -> int
+1654,slice-k-n with k=4 and n=1,"([2, 8, 12, 12, 3, 7, 5, 12, 3, 13],)",[12],list(int) -> list(int)
+1655,remove gt 3,"([3, 6, 6, 6, 3],)","[3, 3]",list(int) -> list(int)
+1656,bool-identify-k with k=4,"([15, 1, 2, 7, 5, 4, 0],)","[False, False, False, False, False, True, False]",list(int) -> list(bool)
+1657,slice-k-n with k=1 and n=2,"([10, 13, 8, 0, 11, 12, 14, 7, 9, 8],)","[10, 13]",list(int) -> list(int)
+1658,slice-k-n with k=1 and n=4,"([6, 7, 15, 2, 2, 16, 15, 12, 6, 3, 3, 14, 5],)","[6, 7, 15, 2]",list(int) -> list(int)
+1659,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 1, 0],)","[0, 0, 1]",list(int) -> list(int)
+1660,prepend-k with k=4,"([16, 5, 0, 2, 3],)","[4, 16, 5, 0, 2, 3]",list(int) -> list(int)
+1661,index-k with k=3,"([3, 7, 16, 2, 2, 13, 0, 13, 5],)",16,list(int) -> int
+1662,take-k with k=3,"([1, 7, 9, 2, 2, 6, 6, 15, 1],)","[1, 7, 9]",list(int) -> list(int)
+1663,repeat-k with k=3,"([11, 5],)","[11, 5, 11, 5, 11, 5]",list(int) -> list(int)
+1664,slice-k-n with k=3 and n=5,"([13, 0, 15, 4, 12, 16, 4, 3, 2, 7, 5, 6, 0, 0, 14],)","[15, 4, 12, 16, 4]",list(int) -> list(int)
+1665,slice-k-n with k=1 and n=4,"([14, 3, 5, 6, 0, 14, 6, 4, 11, 8, 11, 11, 10],)","[14, 3, 5, 6]",list(int) -> list(int)
+1666,bool-identify-is-mod-k with k=4,"([],)",[],list(int) -> list(bool)
+1667,prepend-index-k with k=5,"([2, 11, 7, 7, 0, 4, 5, 11],)","[0, 2, 11, 7, 7, 0, 4, 5, 11]",list(int) -> list(int)
+1668,keep gt 3,"([1, 5, 3, 2, 3],)",[5],list(int) -> list(int)
+1669,remove gt 2,"([0, 1, 5, 1, 3],)","[0, 1, 1]",list(int) -> list(int)
+1670,pow-k with k=4,"([9],)",[6561],list(int) -> list(int)
+1671,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 0, 1, 1, 1],)","[2, 1, 2, 2, 2]",list(int) -> list(int)
+1672,index-k with k=2,"([11, 13, 10, 6, 8],)",13,list(int) -> int
+1673,modulo-k with k=5,"([],)",[],list(int) -> list(int)
+1674,sort,"([],)",[],list(int) -> list(int)
+1675,append-index-k with k=3,"([14, 10, 10, 14, 14, 2, 9],)","[14, 10, 10, 14, 14, 2, 9, 10]",list(int) -> list(int)
+1676,keep-mod-k with k=3,"([12, 15, 0],)","[12, 15, 0]",list(int) -> list(int)
+1677,caesar-cipher-k-modulo-n with k=5 and n=2,"([],)",[],list(int) -> list(int)
+1678,remove-index-k with k=5,"([12, 6, 11, 9, 3],)","[12, 6, 11, 9]",list(int) -> list(int)
+1679,index-head,"([1, 1, 2],)",1,list(int) -> int
+1680,take-k with k=1,"([8, 0],)",[8],list(int) -> list(int)
+1681,repeat-k with k=2,"([2, 10, 13, 15, 3],)","[2, 10, 13, 15, 3, 2, 10, 13, 15, 3]",list(int) -> list(int)
+1682,empty,"([],)",True,list(int) -> bool
+1683,remove gt 3,"([6, 1, 1, 2, 6],)","[1, 1, 2]",list(int) -> list(int)
+1684,bool-identify-is-mod-k with k=2,"([2, 0, 7],)","[True, True, False]",list(int) -> list(bool)
+1685,is-mod-k with k=3,"([8, 8],)",False,list(int) -> bool
+1686,kth-largest with k=3,"([2, 5, 14, 8, 8],)",8,list(int) -> int
+1687,take-k with k=3,"([2, 13, 8, 1, 9],)","[2, 13, 8]",list(int) -> list(int)
+1688,remove eq 3,"([2, 4, 0, 6, 1],)","[2, 4, 0, 6, 1]",list(int) -> list(int)
+1689,pow-k with k=3,"([1, 4, 12],)","[1, 64, 1728]",list(int) -> list(int)
+1690,count-k with k=3,"([5, 16, 12],)",0,list(int) -> int
+1691,append-index-k with k=4,"([0, 12, 16, 14, 14, 8, 4, 0, 6, 2, 7],)","[0, 12, 16, 14, 14, 8, 4, 0, 6, 2, 7, 14]",list(int) -> list(int)
+1692,repeat-k with k=5,"([0, 1, 15, 1, 7],)","[0, 1, 15, 1, 7, 0, 1, 15, 1, 7, 0, 1, 15, 1, 7, 0, 1, 15, 1, 7, 0, 1, 15, 1, 7]",list(int) -> list(int)
+1693,evens,"([1],)",[],list(int) -> list(int)
+1694,replace-all-with-index-k with k=3,"([11, 5, 2, 1, 4, 8],)","[2, 2, 2, 2, 2, 2]",list(int) -> list(int)
+1695,remove empty lists,"([[], [False], [True], [False]],)","[[False], [True], [False]]",list(list(bool)) -> list(list(bool))
+1696,keep gt 0,"([6, 1, 2, 5, 4],)","[6, 1, 2, 5, 4]",list(int) -> list(int)
+1697,add-k with k=5,"([6, 13, 0, 2],)","[11, 18, 5, 7]",list(int) -> list(int)
+1698,slice-k-n with k=4 and n=3,"([1, 9, 0, 13, 8, 10, 14, 8, 15, 10, 10, 6, 14],)","[13, 8, 10]",list(int) -> list(int)
+1699,is-mod-k with k=5,"([4],)",False,list(int) -> bool
+1700,take-k with k=2,"([3, 6, 2, 14],)","[3, 6]",list(int) -> list(int)
+1701,bool-identify-k with k=3,"([10, 0, 15, 9, 13],)","[False, False, False, False, False]",list(int) -> list(bool)
+1702,slice-k-n with k=3 and n=1,"([1, 1, 11, 16, 7, 2],)",[11],list(int) -> list(int)
+1703,remove-mod-k with k=2,"([3, 7, 1, 14],)","[3, 7, 1]",list(int) -> list(int)
+1704,keep-mod-k with k=3,"([],)",[],list(int) -> list(int)
+1705,caesar-cipher-k-modulo-n with k=1 and n=5,"([0],)",[1],list(int) -> list(int)
+1706,slice-k-n with k=3 and n=5,"([2, 8, 14, 13, 9, 7, 3, 1, 8, 3],)","[14, 13, 9, 7, 3]",list(int) -> list(int)
+1707,kth-smallest with k=3,"([16, 4, 10, 7, 5, 7, 1, 2],)",4,list(int) -> int
+1708,take-k with k=3,"([0, 2, 15],)","[0, 2, 15]",list(int) -> list(int)
+1709,has-k with k=4,"([16],)",False,list(int) -> bool
+1710,slice-k-n with k=5 and n=5,"([4, 13, 3, 15, 11, 5, 0, 16, 4, 9, 8, 7, 16, 4, 9, 6],)","[11, 5, 0, 16, 4]",list(int) -> list(int)
+1711,bool-identify-geq-k with k=3,"([5, 5],)","[True, True]",list(int) -> list(bool)
+1712,slice-k-n with k=3 and n=5,"([9, 3, 15, 15, 11, 1, 0, 3, 6, 14, 12, 3, 8, 4],)","[15, 15, 11, 1, 0]",list(int) -> list(int)
+1713,slice-k-n with k=2 and n=4,"([6, 10, 16, 7, 14, 1, 5, 11, 15, 11, 13, 6, 14, 14],)","[10, 16, 7, 14]",list(int) -> list(int)
+1714,drop-k with k=4,"([5, 12, 2, 4, 15, 16],)","[15, 16]",list(int) -> list(int)
+1715,replace-all-with-index-k with k=5,"([9, 13, 7, 14, 0, 3, 12],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+1716,prepend-index-k with k=3,"([7, 8, 1, 6, 16, 11],)","[1, 7, 8, 1, 6, 16, 11]",list(int) -> list(int)
+1717,pow-k with k=2,"([11, 1, 16, 14, 2, 12, 11],)","[121, 1, 256, 196, 4, 144, 121]",list(int) -> list(int)
+1718,is-mod-k with k=2,"([24, 22, 2, 14, 16, 8, 10],)",True,list(int) -> bool
+1719,slice-k-n with k=3 and n=4,"([6, 9, 12, 0, 0, 3, 13, 11, 13],)","[12, 0, 0, 3]",list(int) -> list(int)
+1720,kth-largest with k=3,"([8, 5, 1, 4, 15, 4, 9, 11, 1],)",9,list(int) -> int
+1721,modulo-k with k=1,"([11, 1, 16, 14, 2, 12, 11],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+1722,remove-index-k with k=1,"([4, 4, 12, 7, 13, 9, 1],)","[4, 12, 7, 13, 9, 1]",list(int) -> list(int)
+1723,prepend-index-k with k=5,"([7, 7, 0, 0, 11, 15, 13, 14],)","[11, 7, 7, 0, 0, 11, 15, 13, 14]",list(int) -> list(int)
+1724,drop-k with k=2,"([2, 12, 4, 8, 13, 5, 2, 6],)","[4, 8, 13, 5, 2, 6]",list(int) -> list(int)
+1725,rotate-k with k=2,"([13, 15, 0, 2, 1, 12, 8, 8, 4, 3],)","[4, 3, 13, 15, 0, 2, 1, 12, 8, 8]",list(int) -> list(int)
+1726,slice-k-n with k=2 and n=4,"([14, 1, 5, 0, 2, 11, 8, 11, 1, 1, 0, 3],)","[1, 5, 0, 2]",list(int) -> list(int)
+1727,add-k with k=5,"([16, 13, 9, 13, 0, 3, 10],)","[21, 18, 14, 18, 5, 8, 15]",list(int) -> list(int)
+1728,bool-identify-k with k=5,"([5],)",[True],list(int) -> list(bool)
+1729,repeat-many,"([0, 13, 5, 2, 6],)",[],list(int) -> list(int)
+1730,slice-k-n with k=1 and n=5,"([10, 0, 10, 4, 4, 5, 5, 2, 13, 14, 13, 6, 3],)","[10, 0, 10, 4, 4]",list(int) -> list(int)
+1731,take-k with k=1,"([10, 9, 0, 12],)",[10],list(int) -> list(int)
+1732,modulo-k with k=5,"([7, 4, 0, 1, 11],)","[2, 4, 0, 1, 1]",list(int) -> list(int)
+1733,has-k with k=3,"([3, 3, 3, 4, 3, 3],)",True,list(int) -> bool
+1734,index-k with k=3,"([12, 4, 1, 1],)",1,list(int) -> int
+1735,remove eq 0,"([4, 1, 3, 4, 1],)","[4, 1, 3, 4, 1]",list(int) -> list(int)
+1736,sum,"([14, 1],)",15,list(int) -> int
+1737,slice-k-n with k=5 and n=3,"([16, 0, 12, 14, 8, 8, 11, 7, 16, 11, 16, 2, 0, 14],)","[8, 8, 11]",list(int) -> list(int)
+1738,fibonacci,"(8,)",21,int -> int
+1739,repeat,"([1, 2],)",[2],list(int) -> list(int)
+1740,remove gt 1,"([1, 5, 6, 2, 3],)",[1],list(int) -> list(int)
+1741,bool-identify-k with k=1,"([5, 8, 4, 13, 12],)","[False, False, False, False, False]",list(int) -> list(bool)
+1742,slice-k-n with k=1 and n=4,"([8, 10, 14, 0, 14, 0, 16],)","[8, 10, 14, 0]",list(int) -> list(int)
+1743,count-k with k=0,"([11, 9, 0],)",1,list(int) -> int
+1744,bool-identify-k with k=3,"([],)",[],list(int) -> list(bool)
+1745,keep eq 0,"([3, 5, 3, 4, 5],)",[],list(int) -> list(int)
+1746,caesar-cipher-k-modulo-n with k=1 and n=5,"([1, 0, 2, 2, 2, 0, 2],)","[2, 1, 3, 3, 3, 1, 3]",list(int) -> list(int)
+1747,rotate-k with k=3,"([8, 13, 9, 6, 8, 6],)","[6, 8, 6, 8, 13, 9]",list(int) -> list(int)
+1748,count-k with k=0,"([12],)",0,list(int) -> int
+1749,remove eq 2,"([3, 2, 1, 0, 1],)","[3, 1, 0, 1]",list(int) -> list(int)
+1750,dup,"([8, 16, 5],)","[8, 8, 16, 16, 5, 5]",list(int) -> list(int)
+1751,count-k with k=0,"([0, 0, 9],)",2,list(int) -> int
+1752,slice-k-n with k=5 and n=1,"([13, 16, 6, 11, 11, 16, 8, 1, 1, 1, 15, 11],)",[11],list(int) -> list(int)
+1753,prepend-index-k with k=1,"([5, 0, 0, 13, 1],)","[5, 5, 0, 0, 13, 1]",list(int) -> list(int)
+1754,index-k with k=2,"([9, 1, 10, 13, 4, 11, 10, 5],)",1,list(int) -> int
+1755,slice-k-n with k=5 and n=5,"([13, 5, 3, 2, 12, 3, 9, 10, 9, 16, 15, 6, 9, 0, 7, 16],)","[12, 3, 9, 10, 9]",list(int) -> list(int)
+1756,slice-k-n with k=1 and n=5,"([3, 11, 9, 11, 9, 7, 3, 3, 13, 10, 3],)","[3, 11, 9, 11, 9]",list(int) -> list(int)
+1757,slice-k-n with k=5 and n=2,"([1, 12, 11, 6, 4, 4, 16, 9, 10, 0, 4],)","[4, 4]",list(int) -> list(int)
+1758,bool-identify-geq-k with k=2,"([11, 11, 7, 1],)","[True, True, True, False]",list(int) -> list(bool)
+1759,append-k with k=4,"([11, 2, 9, 8, 8],)","[11, 2, 9, 8, 8, 4]",list(int) -> list(int)
+1760,evens,"([2, 0, 4],)","[2, 0, 4]",list(int) -> list(int)
+1761,empty,"([12, 15],)",False,list(int) -> bool
+1762,fibonacci,"(2,)",1,int -> int
+1763,mult-k with k=0,"([11, 13, 5, 14, 4, 2, 14],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+1764,caesar-cipher-k-modulo-n with k=1 and n=5,"([4, 3, 2, 3, 3, 1],)","[0, 4, 3, 4, 4, 2]",list(int) -> list(int)
+1765,prepend-k with k=0,"([8, 0, 16, 10, 7, 12, 10],)","[0, 8, 0, 16, 10, 7, 12, 10]",list(int) -> list(int)
+1766,kth-largest with k=2,"([5, 16, 1, 6, 12, 5, 6, 10, 10],)",12,list(int) -> int
+1767,remove gt 0,"([1, 0, 1, 4, 5],)",[0],list(int) -> list(int)
+1768,pow-k with k=5,"([12, 11, 8, 8],)","[248832, 161051, 32768, 32768]",list(int) -> list(int)
+1769,prepend-index-k with k=2,"([6, 6, 3, 5],)","[6, 6, 6, 3, 5]",list(int) -> list(int)
+1770,has-k with k=5,"([3, 8, 1],)",False,list(int) -> bool
+1771,remove-mod-k with k=2,"([2, 7, 6, 8],)",[7],list(int) -> list(int)
+1772,prepend-index-k with k=3,"([4, 3, 8, 13, 2, 12, 6, 9, 1],)","[8, 4, 3, 8, 13, 2, 12, 6, 9, 1]",list(int) -> list(int)
+1773,repeat-many,"([4, 3],)","[3, 3, 3, 3]",list(int) -> list(int)
+1774,bool-identify-geq-k with k=4,"([16, 16, 15, 13, 8],)","[True, True, True, True, True]",list(int) -> list(bool)
+1775,replace-all-with-index-k with k=3,"([2, 2, 16, 14, 9, 11, 11],)","[16, 16, 16, 16, 16, 16, 16]",list(int) -> list(int)
+1776,rotate-k with k=4,"([16, 0, 11, 7, 9, 2, 5, 11],)","[9, 2, 5, 11, 16, 0, 11, 7]",list(int) -> list(int)
+1777,prepend-k with k=3,"([],)",[3],list(int) -> list(int)
+1778,remove eq 0,"([2, 4, 1, 1, 2],)","[2, 4, 1, 1, 2]",list(int) -> list(int)
+1779,has-head-in-tail,"([2, 2, 13, 2, 2, 2, 4],)",True,list(int) -> bool
+1780,caesar-cipher-k-modulo-n with k=3 and n=2,"([],)",[],list(int) -> list(int)
+1781,mult-k with k=4,"([],)",[],list(int) -> list(int)
+1782,bool-identify-is-mod-k with k=4,"([11, 12, 7],)","[False, True, False]",list(int) -> list(bool)
+1783,drop-k with k=5,"([13, 11, 10, 7, 13, 11, 9],)","[11, 9]",list(int) -> list(int)
+1784,+1 maximum list,"([10, 5, 6, 9, 10],)",11,list(int) -> int
+1785,keep eq 1,"([1, 1, 5, 6, 5],)","[1, 1]",list(int) -> list(int)
+1786,keep-mod-k with k=2,"([2, 1, 10, 8, 4, 6, 2],)","[2, 10, 8, 4, 6, 2]",list(int) -> list(int)
+1787,repeat-k with k=3,"([10, 8, 4],)","[10, 8, 4, 10, 8, 4, 10, 8, 4]",list(int) -> list(int)
+1788,bool-identify-k with k=0,"([],)",[],list(int) -> list(bool)
+1789,slice-k-n with k=5 and n=5,"([10, 3, 11, 16, 10, 4, 8, 12, 0, 15, 9, 4, 4, 8, 11, 11, 9, 1],)","[10, 4, 8, 12, 0]",list(int) -> list(int)
+1790,prepend-index-k with k=4,"([11, 7, 5, 13, 1, 3, 2, 7, 0, 12],)","[13, 11, 7, 5, 13, 1, 3, 2, 7, 0, 12]",list(int) -> list(int)
+1791,dup,"([0],)","[0, 0]",list(int) -> list(int)
+1792,has-head-in-tail,"([15, 13, 10],)",False,list(int) -> bool
+1793,keep-mod-k with k=2,"([12, 6, 16],)","[12, 6, 16]",list(int) -> list(int)
+1794,kth-smallest with k=1,"([16],)",16,list(int) -> int
+1795,slice-k-n with k=4 and n=4,"([6, 12, 7, 10, 16, 3, 4, 7, 4, 9, 4, 2],)","[10, 16, 3, 4]",list(int) -> list(int)
+1796,caesar-cipher-k-modulo-n with k=1 and n=4,"([],)",[],list(int) -> list(int)
+1797,prepend-k with k=2,"([15, 12, 1, 10, 5, 1],)","[2, 15, 12, 1, 10, 5, 1]",list(int) -> list(int)
+1798,slice-k-n with k=5 and n=2,"([4, 6, 13, 1, 3, 8, 5, 4, 16, 8, 6, 15],)","[3, 8]",list(int) -> list(int)
+1799,mult-k with k=4,"([5, 14, 6, 5, 8],)","[20, 56, 24, 20, 32]",list(int) -> list(int)
+1800,remove eq 3,"([0, 3, 1, 0, 5],)","[0, 1, 0, 5]",list(int) -> list(int)
+1801,append-k with k=4,"([8, 9],)","[8, 9, 4]",list(int) -> list(int)
+1802,rotate-k with k=4,"([5, 2, 5, 8, 2, 2, 2, 10, 12, 5, 13],)","[10, 12, 5, 13, 5, 2, 5, 8, 2, 2, 2]",list(int) -> list(int)
+1803,is-squares,"([1, 4],)",True,list(int) -> bool
+1804,slice-k-n with k=5 and n=2,"([9, 12, 12, 15, 15, 7, 5, 0, 1, 13, 11, 0],)","[15, 7]",list(int) -> list(int)
+1805,caesar-cipher-k-modulo-n with k=4 and n=5,"([1],)",[0],list(int) -> list(int)
+1806,append-k with k=1,"([0, 16],)","[0, 16, 1]",list(int) -> list(int)
+1807,remove eq 0,"([4, 6, 3, 0, 0],)","[4, 6, 3]",list(int) -> list(int)
+1808,head,"([9, 7, 8, 1, 9, 14, 16],)",9,list(int) -> int
+1809,replace-all-with-index-k with k=1,"([14, 10],)","[14, 14]",list(int) -> list(int)
+1810,kth-largest with k=3,"([2, 14, 6, 12, 15],)",12,list(int) -> int
+1811,kth-largest with k=2,"([16, 10, 8, 15, 9, 15, 14, 2, 12],)",15,list(int) -> int
+1812,count-k with k=1,"([1],)",1,list(int) -> int
+1813,is-mod-k with k=1,"([13, 14, 7, 1, 0, 11, 0],)",True,list(int) -> bool
+1814,remove-index-k with k=4,"([6, 5, 2, 13, 14, 5, 12, 6, 16, 11, 8],)","[6, 5, 2, 14, 5, 12, 6, 16, 11, 8]",list(int) -> list(int)
+1815,slice-k-n with k=4 and n=3,"([1, 6, 5, 2, 6, 7, 15, 5, 5, 7],)","[2, 6, 7]",list(int) -> list(int)
+1816,bool-identify-is-mod-k with k=5,"([2, 9, 3, 5, 16, 5],)","[False, False, False, True, False, True]",list(int) -> list(bool)
+1817,slice-k-n with k=5 and n=2,"([13, 13, 3, 6, 5, 1, 1, 7],)","[5, 1]",list(int) -> list(int)
+1818,bool-identify-is-mod-k with k=3,"([3, 3, 3, 3, 3],)","[True, True, True, True, True]",list(int) -> list(bool)
+1819,bool-identify-is-mod-k with k=4,"([14],)",[False],list(int) -> list(bool)
+1820,prepend-k with k=4,"([1, 14, 7, 14, 10],)","[4, 1, 14, 7, 14, 10]",list(int) -> list(int)
+1821,repeat-k with k=2,"([6, 6, 11, 5, 9],)","[6, 6, 11, 5, 9, 6, 6, 11, 5, 9]",list(int) -> list(int)
+1822,rotate-k with k=5,"([6, 9, 9, 0, 15, 12, 1, 8, 5, 14, 8, 2, 0],)","[5, 14, 8, 2, 0, 6, 9, 9, 0, 15, 12, 1, 8]",list(int) -> list(int)
+1823,add-k with k=4,"([0],)",[4],list(int) -> list(int)
+1824,tail,"([5, 9, 1],)","[9, 1]",list(int) -> list(int)
+1825,rotate-k with k=1,"([11, 3, 6, 7, 6, 8, 5, 6, 10, 3, 14, 4, 3, 8],)","[8, 11, 3, 6, 7, 6, 8, 5, 6, 10, 3, 14, 4, 3]",list(int) -> list(int)
+1826,keep-mod-k with k=5,"([40],)",[40],list(int) -> list(int)
+1827,caesar-cipher-k-modulo-n with k=5 and n=3,"([0, 0, 2, 1, 0, 2, 2],)","[2, 2, 1, 0, 2, 1, 1]",list(int) -> list(int)
+1828,slice-k-n with k=3 and n=2,"([1, 13, 12, 5, 9, 8, 6, 4, 1, 16, 12, 15, 5],)","[12, 5]",list(int) -> list(int)
+1829,keep gt 2,"([2, 4, 1, 5, 6],)","[4, 5, 6]",list(int) -> list(int)
+1830,range +1 maximum list,"([1, 0, 2],)","[0, 1, 2]",list(int) -> list(int)
+1831,slice-k-n with k=3 and n=3,"([1, 15, 7, 4, 2, 15, 1, 7, 10, 3],)","[7, 4, 2]",list(int) -> list(int)
+1832,remove eq 3,"([5, 6, 1, 4, 5],)","[5, 6, 1, 4, 5]",list(int) -> list(int)
+1833,slice-k-n with k=3 and n=2,"([1, 1, 6, 15, 11, 7, 1, 6, 8, 14],)","[6, 15]",list(int) -> list(int)
+1834,pow-k with k=4,"([5, 11, 4, 14, 13],)","[625, 14641, 256, 38416, 28561]",list(int) -> list(int)
+1835,caesar-cipher-k-modulo-n with k=1 and n=2,"([1],)",[0],list(int) -> list(int)
+1836,bool-identify-k with k=2,"([2],)",[True],list(int) -> list(bool)
+1837,index-k with k=4,"([4, 5, 2, 14, 6, 9],)",14,list(int) -> int
+1838,slice-k-n with k=4 and n=4,"([4, 0, 15, 15, 10, 0, 11, 14, 4, 15, 10, 5, 7, 10],)","[15, 10, 0, 11]",list(int) -> list(int)
+1839,prepend-k with k=2,"([14],)","[2, 14]",list(int) -> list(int)
+1840,take-k with k=2,"([14, 7, 1, 11],)","[14, 7]",list(int) -> list(int)
+1841,modulo-k with k=3,"([13, 4, 11, 10],)","[1, 1, 2, 1]",list(int) -> list(int)
+1842,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 1, 0, 0, 1, 0, 0],)","[2, 2, 1, 1, 2, 1, 1]",list(int) -> list(int)
+1843,empty,"([],)",True,list(int) -> bool
+1844,len,"([2, 9],)",2,list(int) -> int
+1845,slice-k-n with k=4 and n=2,"([3, 8, 0, 14, 10, 16, 6, 9, 10, 3],)","[14, 10]",list(int) -> list(int)
+1846,add-k with k=4,"([15, 7, 9],)","[19, 11, 13]",list(int) -> list(int)
+1847,sort,"([9],)",[9],list(int) -> list(int)
+1848,remove gt 0,"([2, 3, 3, 6, 0],)",[0],list(int) -> list(int)
+1849,remove-mod-k with k=5,"([30],)",[],list(int) -> list(int)
+1850,kth-smallest with k=4,"([2, 1, 12, 15],)",15,list(int) -> int
+1851,remove-mod-k with k=2,"([10],)",[],list(int) -> list(int)
+1852,remove eq 3,"([0, 0, 6, 2, 1],)","[0, 0, 6, 2, 1]",list(int) -> list(int)
+1853,slice-k-n with k=3 and n=3,"([3, 10, 15, 15, 6, 3, 4, 10, 12, 11, 7, 15],)","[15, 15, 6]",list(int) -> list(int)
+1854,slice-k-n with k=4 and n=4,"([7, 9, 7, 10, 16, 2, 12, 11, 15, 1, 7, 2],)","[10, 16, 2, 12]",list(int) -> list(int)
+1855,has-k with k=2,"([9, 6],)",False,list(int) -> bool
+1856,remove-index-k with k=2,"([0, 3, 2, 9, 14, 4, 12, 13],)","[0, 2, 9, 14, 4, 12, 13]",list(int) -> list(int)
+1857,caesar-cipher-k-modulo-n with k=5 and n=3,"([1, 2, 0],)","[0, 1, 2]",list(int) -> list(int)
+1858,prepend-index-k with k=5,"([6, 10, 0, 12, 3],)","[3, 6, 10, 0, 12, 3]",list(int) -> list(int)
+1859,append-k with k=2,"([0],)","[0, 2]",list(int) -> list(int)
+1860,add-k with k=2,"([5],)",[7],list(int) -> list(int)
+1861,slice-k-n with k=4 and n=3,"([3, 14, 1, 4, 1, 16, 6, 3, 1, 7, 9],)","[4, 1, 16]",list(int) -> list(int)
+1862,range,"(0,)",[],int -> list(int)
+1863,dup,"([7, 8, 16],)","[7, 7, 8, 8, 16, 16]",list(int) -> list(int)
+1864,slice-k-n with k=2 and n=2,"([12, 2, 10, 14, 4, 0, 4],)","[2, 10]",list(int) -> list(int)
+1865,keep primes,"([13, 2, 23, 3, 11, 5, 1],)","[13, 2, 23, 3, 11, 5]",list(int) -> list(int)
+1866,drop-k with k=3,"([14, 16, 4, 13, 11, 6, 13, 16, 1, 5],)","[13, 11, 6, 13, 16, 1, 5]",list(int) -> list(int)
+1867,caesar-cipher-k-modulo-n with k=1 and n=4,"([0, 2, 1, 2],)","[1, 3, 2, 3]",list(int) -> list(int)
+1868,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 2, 0, 1, 2, 1, 1],)","[0, 0, 2, 3, 0, 3, 3]",list(int) -> list(int)
+1869,repeat-k with k=4,"([3, 5],)","[3, 5, 3, 5, 3, 5, 3, 5]",list(int) -> list(int)
+1870,kth-smallest with k=4,"([0, 11, 12, 9, 15, 16, 0, 8],)",9,list(int) -> int
+1871,min,"([1],)",1,list(int) -> int
+1872,prepend-k with k=5,"([],)",[5],list(int) -> list(int)
+1873,caesar-cipher-k-modulo-n with k=1 and n=5,"([],)",[],list(int) -> list(int)
+1874,slice-k-n with k=2 and n=1,"([0, 0, 4, 12, 0, 3, 9],)",[0],list(int) -> list(int)
+1875,min,"([1, 7, 12, 6, 15, 12, 9],)",1,list(int) -> int
+1876,replace-all-with-index-k with k=5,"([16, 5, 7, 1, 5],)","[5, 5, 5, 5, 5]",list(int) -> list(int)
+1877,add-k with k=4,"([10, 8],)","[14, 12]",list(int) -> list(int)
+1878,+1 maximum list,"([3, 6, 7, 1],)",8,list(int) -> int
+1879,dup,"([14, 3, 7, 3, 12, 8],)","[14, 14, 3, 3, 7, 7, 3, 3, 12, 12, 8, 8]",list(int) -> list(int)
+1880,count-head-in-tail,"([10, 12, 1, 6, 9, 3, 11],)",0,list(int) -> int
+1881,empty,"([],)",True,list(int) -> bool
+1882,append-k with k=0,"([4, 0],)","[4, 0, 0]",list(int) -> list(int)
+1883,reverse,"([15, 7, 11],)","[11, 7, 15]",list(int) -> list(int)
+1884,modulo-k with k=2,"([9],)",[1],list(int) -> list(int)
+1885,mult-k with k=4,"([3],)",[12],list(int) -> list(int)
+1886,index-k with k=3,"([4, 11, 14, 0, 13, 1, 10, 5],)",14,list(int) -> int
+1887,pow-k with k=3,"([4, 3, 7, 10, 4],)","[64, 27, 343, 1000, 64]",list(int) -> list(int)
+1888,caesar-cipher-k-modulo-n with k=5 and n=4,"([3, 1, 3],)","[0, 2, 0]",list(int) -> list(int)
+1889,max,"([1, 2, 3],)",3,list(int) -> int
+1890,bool-identify-geq-k with k=3,"([7, 5, 6, 7, 9, 3],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+1891,count-k with k=3,"([3, 6, 1, 15, 12, 13],)",1,list(int) -> int
+1892,prepend-k with k=4,"([6, 10, 5, 4],)","[4, 6, 10, 5, 4]",list(int) -> list(int)
+1893,append-k with k=5,"([2, 1, 16, 7, 11, 7],)","[2, 1, 16, 7, 11, 7, 5]",list(int) -> list(int)
+1894,sum,"([0, 11, 4, 11, 1, 6, 12],)",45,list(int) -> int
+1895,drop-k with k=5,"([16, 7, 3, 14, 4, 9, 1, 13, 4, 8, 6],)","[9, 1, 13, 4, 8, 6]",list(int) -> list(int)
+1896,bool-identify-geq-k with k=5,"([7, 10],)","[True, True]",list(int) -> list(bool)
+1897,drop-k with k=2,"([14, 9, 12, 12, 2, 16, 1, 3, 4],)","[12, 12, 2, 16, 1, 3, 4]",list(int) -> list(int)
+1898,bool-identify-is-mod-k with k=4,"([4, 4, 2, 4, 4, 4],)","[True, True, False, True, True, True]",list(int) -> list(bool)
+1899,take-k with k=5,"([13, 0, 12, 14, 15, 15],)","[13, 0, 12, 14, 15]",list(int) -> list(int)
+1900,slice-k-n with k=3 and n=5,"([2, 11, 6, 1, 16, 9, 12, 12, 9, 5, 6, 4, 13, 16, 14, 6],)","[6, 1, 16, 9, 12]",list(int) -> list(int)
+1901,append-k with k=2,"([4, 13, 1, 7, 8],)","[4, 13, 1, 7, 8, 2]",list(int) -> list(int)
+1902,mult-k with k=0,"([5, 10, 15],)","[0, 0, 0]",list(int) -> list(int)
+1903,modulo-k with k=5,"([7],)",[2],list(int) -> list(int)
+1904,drop-k with k=3,"([1, 5, 8, 16, 15, 10, 14, 11],)","[16, 15, 10, 14, 11]",list(int) -> list(int)
+1905,count-head-in-tail,"([3, 1, 3, 3, 2],)",2,list(int) -> int
+1906,has-k with k=2,"([2],)",True,list(int) -> bool
+1907,caesar-cipher-k-modulo-n with k=4 and n=5,"([2, 3, 3],)","[1, 2, 2]",list(int) -> list(int)
+1908,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 1, 0, 0],)","[2, 2, 1, 1]",list(int) -> list(int)
+1909,mult-k with k=0,"([8],)",[0],list(int) -> list(int)
+1910,head,"([5, 6, 2, 8, 9],)",5,list(int) -> int
+1911,bool-identify-k with k=0,"([16, 15, 11],)","[False, False, False]",list(int) -> list(bool)
+1912,caesar-cipher-k-modulo-n with k=5 and n=3,"([2],)",[1],list(int) -> list(int)
+1913,index-k with k=5,"([16, 11, 8, 8, 5, 6, 2],)",5,list(int) -> int
+1914,range,"(6,)","[0, 1, 2, 3, 4, 5]",int -> list(int)
+1915,caesar-cipher-k-modulo-n with k=5 and n=4,"([],)",[],list(int) -> list(int)
+1916,append-k with k=0,"([],)",[0],list(int) -> list(int)
+1917,mult-k with k=3,"([4],)",[12],list(int) -> list(int)
+1918,count-k with k=4,"([4, 4, 4, 4, 4, 4],)",6,list(int) -> int
+1919,drop-k with k=2,"([13, 10, 5, 13, 5, 1],)","[5, 13, 5, 1]",list(int) -> list(int)
+1920,replace-all-with-index-k with k=3,"([8, 5, 9, 6, 6, 10],)","[9, 9, 9, 9, 9, 9]",list(int) -> list(int)
+1921,bool-identify-is-mod-k with k=2,"([4, 16, 10],)","[True, True, True]",list(int) -> list(bool)
+1922,kth-largest with k=2,"([13, 0],)",0,list(int) -> int
+1923,sort,"([13],)",[13],list(int) -> list(int)
+1924,remove eq 0,"([6, 3, 0, 0, 0],)","[6, 3]",list(int) -> list(int)
+1925,remove-index-k with k=4,"([16, 13, 8, 3, 15, 0, 4, 2, 11],)","[16, 13, 8, 15, 0, 4, 2, 11]",list(int) -> list(int)
+1926,remove eq 3,"([4, 1, 5, 6, 0],)","[4, 1, 5, 6, 0]",list(int) -> list(int)
+1927,prepend-k with k=4,"([11, 11, 5, 7],)","[4, 11, 11, 5, 7]",list(int) -> list(int)
+1928,bool-identify-is-mod-k with k=3,"([3, 3],)","[True, True]",list(int) -> list(bool)
+1929,pop,"([4, 11, 7],)","[4, 11]",list(int) -> list(int)
+1930,add-k with k=5,"([16, 12, 15, 7],)","[21, 17, 20, 12]",list(int) -> list(int)
+1931,keep squares,"([25, 1, 5, 9, 1, 5, 9],)","[25, 1, 9, 1, 9]",list(int) -> list(int)
+1932,bool-identify-is-mod-k with k=3,"([1, 12, 8],)","[False, True, False]",list(int) -> list(bool)
+1933,kth-smallest with k=2,"([1, 1, 6, 8],)",1,list(int) -> int
+1934,append-index-k with k=5,"([7, 7, 5, 15, 2],)","[7, 7, 5, 15, 2, 2]",list(int) -> list(int)
+1935,drop-k with k=4,"([14, 4, 4, 13, 12],)",[12],list(int) -> list(int)
+1936,rotate-k with k=1,"([10, 2, 5, 10, 14, 15, 9, 11, 13, 5, 15, 1, 15, 0, 9, 0, 12],)","[12, 10, 2, 5, 10, 14, 15, 9, 11, 13, 5, 15, 1, 15, 0, 9, 0]",list(int) -> list(int)
+1937,has-k with k=1,"([1],)",True,list(int) -> bool
+1938,kth-largest with k=4,"([12, 10, 12, 0, 2, 10, 9, 6],)",10,list(int) -> int
+1939,count-k with k=0,"([16, 12, 15],)",0,list(int) -> int
+1940,append-k with k=2,"([],)",[2],list(int) -> list(int)
+1941,has-head-in-tail,"([1, 1, 2],)",True,list(int) -> bool
+1942,take-k with k=2,"([13, 14, 1],)","[13, 14]",list(int) -> list(int)
+1943,prepend-k with k=5,"([12, 15, 6, 1, 7, 2],)","[5, 12, 15, 6, 1, 7, 2]",list(int) -> list(int)
+1944,append-k with k=4,"([13, 11],)","[13, 11, 4]",list(int) -> list(int)
+1945,pow-k with k=3,"([12],)",[1728],list(int) -> list(int)
+1946,has-k with k=2,"([15, 16],)",False,list(int) -> bool
+1947,product,"([9, 5, 6, 11, 6, 13, 14],)",3243240,list(int) -> int
+1948,keep-mod-k with k=5,"([35, 25],)","[35, 25]",list(int) -> list(int)
+1949,bool-identify-k with k=0,"([12],)",[False],list(int) -> list(bool)
+1950,keep eq 3,"([1, 4, 1, 2, 6],)",[],list(int) -> list(int)
+1951,bool-identify-geq-k with k=1,"([-3, -3],)","[False, False]",list(int) -> list(bool)
+1952,remove eq 1,"([0, 3, 6, 3, 5],)","[0, 3, 6, 3, 5]",list(int) -> list(int)
+1953,bool-identify-is-mod-k with k=3,"([5, 8, 8, 9, 4, 4],)","[False, False, False, True, False, False]",list(int) -> list(bool)
+1954,add-k with k=5,"([7, 4, 11],)","[12, 9, 16]",list(int) -> list(int)
+1955,mult-k with k=2,"([8, 2, 8],)","[16, 4, 16]",list(int) -> list(int)
+1956,drop-k with k=2,"([0, 9, 1],)",[1],list(int) -> list(int)
+1957,bool-identify-k with k=1,"([1, 1, 1],)","[True, True, True]",list(int) -> list(bool)
+1958,is-primes,"([],)",True,list(int) -> bool
+1959,append-k with k=5,"([4, 2],)","[4, 2, 5]",list(int) -> list(int)
+1960,repeat-k with k=3,"([8],)","[8, 8, 8]",list(int) -> list(int)
+1961,is-squares,"([9, 1],)",True,list(int) -> bool
+1962,range +1 maximum list,"([4, 7, 7, 8, 8],)","[0, 1, 2, 3, 4, 5, 6, 7, 8]",list(int) -> list(int)
+1963,caesar-cipher-k-modulo-n with k=3 and n=5,"([1, 2, 2, 4],)","[4, 0, 0, 2]",list(int) -> list(int)
+1964,prepend-index-k with k=3,"([6, 8, 5, 6, 10, 3],)","[5, 6, 8, 5, 6, 10, 3]",list(int) -> list(int)
+1965,slice-k-n with k=3 and n=2,"([7, 9, 3, 7, 11, 11],)","[3, 7]",list(int) -> list(int)
+1966,evens,"([],)",[],list(int) -> list(int)
+1967,sum,"([3],)",3,list(int) -> int
+1968,repeat-k with k=5,"([4, 8, 16, 4],)","[4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4]",list(int) -> list(int)
+1969,caesar-cipher-k-modulo-n with k=1 and n=3,"([],)",[],list(int) -> list(int)
+1970,bool-identify-geq-k with k=2,"([0, 10, 0, 0],)","[False, True, False, False]",list(int) -> list(bool)
+1971,caesar-cipher-k-modulo-n with k=2 and n=5,"([0, 0, 2, 4, 0, 1, 0],)","[2, 2, 4, 1, 2, 3, 2]",list(int) -> list(int)
+1972,kth-largest with k=4,"([11, 1, 8, 6, 5, 4, 10, 12, 15, 8],)",10,list(int) -> int
+1973,has-k with k=3,"([],)",False,list(int) -> bool
+1974,kth-smallest with k=5,"([12, 6, 11, 9, 3],)",12,list(int) -> int
+1975,drop-k with k=2,"([2, 12, 7, 12],)","[7, 12]",list(int) -> list(int)
+1976,bool-identify-k with k=4,"([4, 4, 4, 4, 4],)","[True, True, True, True, True]",list(int) -> list(bool)
+1977,slice-k-n with k=5 and n=5,"([14, 2, 11, 14, 15, 6, 12, 8, 12, 4, 3, 2, 3, 1, 1],)","[15, 6, 12, 8, 12]",list(int) -> list(int)
+1978,bool-identify-geq-k with k=0,"([3, 10, 8, 13, 11, 15],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+1979,append-k with k=2,"([4, 5, 15, 0],)","[4, 5, 15, 0, 2]",list(int) -> list(int)
+1980,remove-mod-head,"([3, 4, 8, 5, 8],)","[4, 8, 5, 8]",list(int) -> list(int)
+1981,remove empty lists,"([[True, True, False], [False, True, True], [], [False]],)","[[True, True, False], [False, True, True], [False]]",list(list(bool)) -> list(list(bool))
+1982,keep gt 2,"([6, 3, 0, 2, 2],)","[6, 3]",list(int) -> list(int)
+1983,replace-all-with-index-k with k=1,"([3, 9, 14, 11, 13, 7, 1, 10],)","[3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+1984,add-k with k=2,"([11, 5, 7, 6, 8],)","[13, 7, 9, 8, 10]",list(int) -> list(int)
+1985,modulo-k with k=4,"([12, 14],)","[0, 2]",list(int) -> list(int)
+1986,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 1, 2, 1, 2, 2, 2],)","[2, 2, 0, 2, 0, 0, 0]",list(int) -> list(int)
+1987,sort,"([11, 8, 14, 7, 8],)","[7, 8, 8, 11, 14]",list(int) -> list(int)
+1988,caesar-cipher-k-modulo-n with k=3 and n=5,"([2, 1, 0, 3],)","[0, 4, 3, 1]",list(int) -> list(int)
+1989,keep-mod-k with k=2,"([],)",[],list(int) -> list(int)
+1990,mult-k with k=4,"([11],)",[44],list(int) -> list(int)
+1991,sort,"([7, 2, 10, 13],)","[2, 7, 10, 13]",list(int) -> list(int)
+1992,take-k with k=5,"([7, 16, 10, 1, 4, 4, 3, 1, 1, 1],)","[7, 16, 10, 1, 4]",list(int) -> list(int)
+1993,bool-identify-is-mod-k with k=2,"([2, 6],)","[True, True]",list(int) -> list(bool)
+1994,bool-identify-is-mod-k with k=1,"([],)",[],list(int) -> list(bool)
+1995,bool-identify-k with k=4,"([4, 4, 14, 4, 16],)","[True, True, False, True, False]",list(int) -> list(bool)
+1996,is-mod-k with k=2,"([9, 9],)",False,list(int) -> bool
+1997,bool-identify-k with k=5,"([14],)",[False],list(int) -> list(bool)
+1998,remove eq 1,"([1, 2, 2, 5, 0],)","[2, 2, 5, 0]",list(int) -> list(int)
+1999,prepend-index-k with k=4,"([7, 2, 8, 11, 5, 9, 8, 9, 7],)","[11, 7, 2, 8, 11, 5, 9, 8, 9, 7]",list(int) -> list(int)
+2000,repeat-k with k=2,"([0, 9, 3, 1, 2],)","[0, 9, 3, 1, 2, 0, 9, 3, 1, 2]",list(int) -> list(int)
+2001,rotate-k with k=4,"([3, 5, 11, 7, 11, 10, 3, 14, 0],)","[10, 3, 14, 0, 3, 5, 11, 7, 11]",list(int) -> list(int)
+2002,replace-all-with-index-k with k=3,"([12, 12, 14, 10, 3],)","[14, 14, 14, 14, 14]",list(int) -> list(int)
+2003,index-k with k=1,"([0, 7, 3, 15, 11, 1, 16],)",0,list(int) -> int
+2004,append-k with k=5,"([15, 0, 13],)","[15, 0, 13, 5]",list(int) -> list(int)
+2005,keep-mod-k with k=4,"([20, 6, 28, 4, 32],)","[20, 28, 4, 32]",list(int) -> list(int)
+2006,bool-identify-k with k=5,"([8],)",[False],list(int) -> list(bool)
+2007,min,"([7, 9, 7, 7, 8, 1],)",1,list(int) -> int
+2008,pow-k with k=3,"([1, 16, 12],)","[1, 4096, 1728]",list(int) -> list(int)
+2009,remove-mod-k with k=3,"([7],)",[7],list(int) -> list(int)
+2010,keep-mod-k with k=5,"([15, 1, 20, 2, 2],)","[15, 20]",list(int) -> list(int)
+2011,has-k with k=1,"([0, 0, 5, 3],)",False,list(int) -> bool
+2012,remove gt 3,"([5, 5, 0, 2, 6],)","[0, 2]",list(int) -> list(int)
+2013,keep gt 1,"([2, 5, 0, 4, 2],)","[2, 5, 4, 2]",list(int) -> list(int)
+2014,take-k with k=4,"([8, 9, 9, 11, 0],)","[8, 9, 9, 11]",list(int) -> list(int)
+2015,sort-and-deduplicate,"([8, 9, 5, 3],)","[3, 5, 8, 9]",list(int) -> list(int)
+2016,is-mod-k with k=1,"([4],)",True,list(int) -> bool
+2017,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 1, 2],)","[0, 3, 0]",list(int) -> list(int)
+2018,repeat-many,"([2, 1, 2, 3],)","[1, 2, 3, 1, 2, 3]",list(int) -> list(int)
+2019,remove eq 1,"([6, 5, 3, 6, 1],)","[6, 5, 3, 6]",list(int) -> list(int)
+2020,modulo-k with k=1,"([7, 10, 9, 7, 8, 8],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+2021,bool-identify-k with k=3,"([3, 3, 3, 3, 3, 6, 3],)","[True, True, True, True, True, False, True]",list(int) -> list(bool)
+2022,bool-identify-geq-k with k=0,"([3, 3, 3, 3, 13, 14, 9],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2023,len,"([10, 14, 8, 2, 12, 10, 3],)",7,list(int) -> int
+2024,rotate-k with k=4,"([12, 6, 15, 12, 9, 14, 7, 9, 7, 7, 8, 1],)","[7, 7, 8, 1, 12, 6, 15, 12, 9, 14, 7, 9]",list(int) -> list(int)
+2025,range,"(2,)","[0, 1]",int -> list(int)
+2026,bool-identify-is-mod-k with k=1,"([],)",[],list(int) -> list(bool)
+2027,bool-identify-k with k=5,"([5, 16, 11, 5],)","[True, False, False, True]",list(int) -> list(bool)
+2028,index-head,"([3, 1, 3, 4, 2],)",4,list(int) -> int
+2029,add-k with k=3,"([9, 14, 9],)","[12, 17, 12]",list(int) -> list(int)
+2030,slice-k-n with k=1 and n=1,"([0, 11, 13, 1, 16, 11, 3, 4, 11, 4],)",[0],list(int) -> list(int)
+2031,count-k with k=2,"([2, 2, 2, 2, 2, 2, 2],)",7,list(int) -> int
+2032,is-mod-k with k=3,"([36, 27, 45, 21, 18, 45],)",True,list(int) -> bool
+2033,kth-largest with k=4,"([7, 16, 6, 13, 16, 4, 7],)",7,list(int) -> int
+2034,index-k with k=2,"([9, 9, 1],)",9,list(int) -> int
+2035,reverse,"([8, 7, 11, 7, 15, 11],)","[11, 15, 7, 11, 7, 8]",list(int) -> list(int)
+2036,remove-mod-head,"([1, 2, 3],)",[],list(int) -> list(int)
+2037,keep eq 3,"([4, 2, 1, 5, 4],)",[],list(int) -> list(int)
+2038,add-k with k=4,"([14, 12, 9, 15, 7],)","[18, 16, 13, 19, 11]",list(int) -> list(int)
+2039,add-k with k=1,"([14],)",[15],list(int) -> list(int)
+2040,drop-k with k=3,"([8, 5, 1, 4, 15, 4, 9, 11, 1],)","[4, 15, 4, 9, 11, 1]",list(int) -> list(int)
+2041,has-k with k=1,"([16, 10, 7, 12, 13, 3],)",False,list(int) -> bool
+2042,count-head-in-tail,"([9, 14, 15, 7, 2, 6, 2],)",0,list(int) -> int
+2043,remove eq 2,"([3, 5, 4, 5, 4],)","[3, 5, 4, 5, 4]",list(int) -> list(int)
+2044,drop-k with k=4,"([11, 1, 8, 6, 5, 4, 10, 12, 15, 8],)","[5, 4, 10, 12, 15, 8]",list(int) -> list(int)
+2045,caesar-cipher-k-modulo-n with k=1 and n=4,"([1, 2, 1, 3, 1],)","[2, 3, 2, 0, 2]",list(int) -> list(int)
+2046,index-k with k=4,"([1, 11, 0, 11],)",11,list(int) -> int
+2047,index-head,"([4, 2, 6, 10, 8, 12],)",8,list(int) -> int
+2048,prepend-k with k=0,"([12, 4],)","[0, 12, 4]",list(int) -> list(int)
+2049,caesar-cipher-k-modulo-n with k=4 and n=5,"([0],)",[4],list(int) -> list(int)
+2050,count-k with k=2,"([3, 8, 1],)",0,list(int) -> int
+2051,mult-k with k=0,"([15, 5],)","[0, 0]",list(int) -> list(int)
+2052,caesar-cipher-k-modulo-n with k=1 and n=4,"([0],)",[1],list(int) -> list(int)
+2053,kth-smallest with k=3,"([15, 1, 4],)",15,list(int) -> int
+2054,rotate-k with k=5,"([15, 16, 5, 13, 10, 5, 4, 3, 7, 1, 5, 10],)","[3, 7, 1, 5, 10, 15, 16, 5, 13, 10, 5, 4]",list(int) -> list(int)
+2055,is-mod-k with k=3,"([21, 0, 27, 6],)",True,list(int) -> bool
+2056,product,"([0, 4, 11, 12, 15, 5, 2],)",0,list(int) -> int
+2057,slice-k-n with k=4 and n=3,"([6, 1, 15, 0, 10, 9, 3, 13, 1, 12, 15, 3, 14, 1, 6],)","[0, 10, 9]",list(int) -> list(int)
+2058,tail,"([2, 3, 6, 7],)","[3, 6, 7]",list(int) -> list(int)
+2059,keep primes,"([31, 5, 3, 5, 31, 5, 5],)","[31, 5, 3, 5, 31, 5, 5]",list(int) -> list(int)
+2060,replace-all-with-index-k with k=2,"([10, 11, 9, 13],)","[11, 11, 11, 11]",list(int) -> list(int)
+2061,append-index-k with k=2,"([11, 4],)","[11, 4, 4]",list(int) -> list(int)
+2062,range +1 maximum list,"([4, 3, 8, 0],)","[0, 1, 2, 3, 4, 5, 6, 7, 8]",list(int) -> list(int)
+2063,remove-mod-head,"([5, 2, 14, 10, 13],)","[2, 14, 13]",list(int) -> list(int)
+2064,replace-all-with-index-k with k=5,"([9, 8, 15, 3, 4, 13, 9, 3, 3],)","[4, 4, 4, 4, 4, 4, 4, 4, 4]",list(int) -> list(int)
+2065,take-k with k=1,"([12, 5, 4, 11, 4, 4],)",[12],list(int) -> list(int)
+2066,index-k with k=5,"([1, 12, 15, 3, 7, 14],)",7,list(int) -> int
+2067,slice-k-n with k=3 and n=4,"([10, 9, 3, 3, 4, 8, 9, 6, 6],)","[3, 3, 4, 8]",list(int) -> list(int)
+2068,head,"([2],)",2,list(int) -> int
+2069,has-k with k=3,"([3],)",True,list(int) -> bool
+2070,count-k with k=1,"([5, 8, 4, 13, 12],)",0,list(int) -> int
+2071,append-k with k=3,"([6, 14, 12, 4, 4, 15],)","[6, 14, 12, 4, 4, 15, 3]",list(int) -> list(int)
+2072,remove-index-k with k=2,"([14, 5, 3],)","[14, 3]",list(int) -> list(int)
+2073,slice-k-n with k=1 and n=1,"([15, 0, 1, 9, 3, 14, 6, 10, 12, 5],)",[15],list(int) -> list(int)
+2074,range +1 maximum list,"([5, 4, 4],)","[0, 1, 2, 3, 4, 5]",list(int) -> list(int)
+2075,modulo-k with k=3,"([10, 8],)","[1, 2]",list(int) -> list(int)
+2076,sort-and-deduplicate,"([2, 9, 1, 0],)","[0, 1, 2, 9]",list(int) -> list(int)
+2077,append-k with k=3,"([11, 4, 7, 9, 5, 2],)","[11, 4, 7, 9, 5, 2, 3]",list(int) -> list(int)
+2078,modulo-k with k=4,"([],)",[],list(int) -> list(int)
+2079,keep squares,"([9, 6, 6, 5, 4, 6, 25],)","[9, 4, 25]",list(int) -> list(int)
+2080,sort,"([8],)",[8],list(int) -> list(int)
+2081,pow-k with k=3,"([],)",[],list(int) -> list(int)
+2082,product,"([3, 10, 8, 13, 11],)",34320,list(int) -> int
+2083,bool-identify-k with k=4,"([4, 4, 4, 12],)","[True, True, True, False]",list(int) -> list(bool)
+2084,add-k with k=2,"([16, 13, 6, 8, 14, 8, 2],)","[18, 15, 8, 10, 16, 10, 4]",list(int) -> list(int)
+2085,remove-mod-k with k=3,"([],)",[],list(int) -> list(int)
+2086,append-index-k with k=4,"([2, 4, 8, 9, 3],)","[2, 4, 8, 9, 3, 9]",list(int) -> list(int)
+2087,keep eq 2,"([5, 0, 6, 3, 6],)",[],list(int) -> list(int)
+2088,has-k with k=0,"([0, 0, 0],)",True,list(int) -> bool
+2089,append-k with k=2,"([4, 11, 8, 4, 10],)","[4, 11, 8, 4, 10, 2]",list(int) -> list(int)
+2090,append-index-k with k=2,"([7, 12, 7, 8, 13, 11, 8, 4],)","[7, 12, 7, 8, 13, 11, 8, 4, 12]",list(int) -> list(int)
+2091,sum,"([8, 5],)",13,list(int) -> int
+2092,append-k with k=2,"([8, 13, 11],)","[8, 13, 11, 2]",list(int) -> list(int)
+2093,pop,"([14, 16, 1, 3, 10, 0],)","[14, 16, 1, 3, 10]",list(int) -> list(int)
+2094,replace-all-with-index-k with k=5,"([0, 5, 7, 11, 11, 0, 12, 3, 1],)","[11, 11, 11, 11, 11, 11, 11, 11, 11]",list(int) -> list(int)
+2095,bool-identify-is-prime,"([6, 13, 0, 2],)","[False, True, False, True]",list(int) -> list(bool)
+2096,slice-k-n with k=2 and n=4,"([0, 16, 7, 11, 3, 14, 9, 16, 8, 12],)","[16, 7, 11, 3]",list(int) -> list(int)
+2097,pow-k with k=5,"([0, 13, 1, 10, 5, 2, 8],)","[0, 371293, 1, 100000, 3125, 32, 32768]",list(int) -> list(int)
+2098,take-k with k=5,"([7, 12, 4, 9, 7, 10, 8, 15, 10, 15, 0, 15],)","[7, 12, 4, 9, 7]",list(int) -> list(int)
+2099,slice-k-n with k=5 and n=3,"([15, 9, 13, 4, 4, 0, 16, 6, 4, 3, 0, 14, 16, 10, 13, 5],)","[4, 0, 16]",list(int) -> list(int)
+2100,remove eq 2,"([6, 2, 4, 6, 1],)","[6, 4, 6, 1]",list(int) -> list(int)
+2101,bool-identify-geq-k with k=1,"([4],)",[True],list(int) -> list(bool)
+2102,take-k with k=3,"([15, 7, 11, 10, 10, 9, 8],)","[15, 7, 11]",list(int) -> list(int)
+2103,mult-k with k=0,"([9, 7],)","[0, 0]",list(int) -> list(int)
+2104,bool-identify-k with k=1,"([6, 1, 1, 1],)","[False, True, True, True]",list(int) -> list(bool)
+2105,bool-identify-geq-k with k=0,"([12],)",[True],list(int) -> list(bool)
+2106,count-k with k=3,"([3, 3, 3],)",3,list(int) -> int
+2107,caesar-cipher-k-modulo-n with k=1 and n=4,"([0, 3, 3],)","[1, 0, 0]",list(int) -> list(int)
+2108,keep gt 1,"([2, 6, 6, 3, 2],)","[2, 6, 6, 3, 2]",list(int) -> list(int)
+2109,remove-index-k with k=2,"([0, 9, 6, 7, 15],)","[0, 6, 7, 15]",list(int) -> list(int)
+2110,repeat,"([3, 7],)","[7, 7, 7]",list(int) -> list(int)
+2111,slice-k-n with k=5 and n=1,"([8, 2, 13, 14, 12, 1, 7, 1, 13, 4, 5],)",[12],list(int) -> list(int)
+2112,caesar-cipher-k-modulo-n with k=2 and n=4,"([0, 2, 1, 2],)","[2, 0, 3, 0]",list(int) -> list(int)
+2113,is-mod-k with k=4,"([40, 32, 16, 28],)",True,list(int) -> bool
+2114,slice-k-n with k=4 and n=1,"([10, 5, 5, 12, 14, 10, 3, 6, 7, 15, 0],)",[12],list(int) -> list(int)
+2115,caesar-cipher-k-modulo-n with k=2 and n=5,"([1, 2, 4, 1, 0],)","[3, 4, 1, 3, 2]",list(int) -> list(int)
+2116,caesar-cipher-k-modulo-n with k=5 and n=4,"([],)",[],list(int) -> list(int)
+2117,bool-identify-is-mod-k with k=5,"([15, 0, 1, 3, 16, 9],)","[True, True, False, False, False, False]",list(int) -> list(bool)
+2118,repeat-k with k=3,"([8],)","[8, 8, 8]",list(int) -> list(int)
+2119,is-squares,"([144, 169],)",True,list(int) -> bool
+2120,add-k with k=1,"([9, 1, 13, 10, 13],)","[10, 2, 14, 11, 14]",list(int) -> list(int)
+2121,bool-identify-geq-k with k=3,"([12, 6, 11, 16, 7, 10, 3],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2122,kth-largest with k=5,"([1, 12, 11, 6, 11, 15, 11, 2, 7, 8, 13],)",11,list(int) -> int
+2123,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 1, 0, 0, 1, 0, 0],)","[2, 2, 1, 1, 2, 1, 1]",list(int) -> list(int)
+2124,add-k with k=4,"([16, 10, 7, 12, 13, 3],)","[20, 14, 11, 16, 17, 7]",list(int) -> list(int)
+2125,bool-identify-is-mod-k with k=5,"([13, 5, 5, 8],)","[False, True, True, False]",list(int) -> list(bool)
+2126,tail,"([5, 9, 14],)","[9, 14]",list(int) -> list(int)
+2127,replace-all-with-index-k with k=2,"([3, 4, 5],)","[4, 4, 4]",list(int) -> list(int)
+2128,evens,"([2, 2, 8, 7],)","[2, 2, 8]",list(int) -> list(int)
+2129,has-k with k=2,"([],)",False,list(int) -> bool
+2130,prepend-index-k with k=2,"([9, 12, 3, 13],)","[12, 9, 12, 3, 13]",list(int) -> list(int)
+2131,bool-identify-is-mod-k with k=4,"([13, 2],)","[False, False]",list(int) -> list(bool)
+2132,odds,"([2, 12, 6, 9, 1, 12],)","[9, 1]",list(int) -> list(int)
+2133,slice-k-n with k=5 and n=1,"([3, 16, 9, 15, 13, 13, 15, 4, 11, 9, 16],)",[13],list(int) -> list(int)
+2134,prepend-index-k with k=3,"([8, 14, 3, 5, 11],)","[3, 8, 14, 3, 5, 11]",list(int) -> list(int)
+2135,kth-largest with k=4,"([0, 13, 4, 2],)",0,list(int) -> int
+2136,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 1, 1, 1, 0],)","[0, 0, 0, 0, 1]",list(int) -> list(int)
+2137,bool-identify-geq-k with k=0,"([],)",[],list(int) -> list(bool)
+2138,pow-k with k=2,"([10, 14, 8, 2, 12, 10, 3],)","[100, 196, 64, 4, 144, 100, 9]",list(int) -> list(int)
+2139,remove-index-k with k=3,"([1, 14, 9, 7, 11, 16],)","[1, 14, 7, 11, 16]",list(int) -> list(int)
+2140,range,"(3,)","[0, 1, 2]",int -> list(int)
+2141,slice-k-n with k=3 and n=1,"([15, 3, 7, 9, 10, 9, 13],)",[7],list(int) -> list(int)
+2142,caesar-cipher-k-modulo-n with k=1 and n=4,"([0, 1, 1, 2, 3],)","[1, 2, 2, 3, 0]",list(int) -> list(int)
+2143,slice-k-n with k=1 and n=2,"([8, 0, 4, 6, 16, 1, 6],)","[8, 0]",list(int) -> list(int)
+2144,slice-k-n with k=5 and n=4,"([5, 12, 3, 12, 15, 2, 6, 6, 15, 11, 16, 2],)","[15, 2, 6, 6]",list(int) -> list(int)
+2145,is-primes,"([4, 13],)",False,list(int) -> bool
+2146,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 0, 0, 2, 0, 1],)","[0, 2, 2, 1, 2, 0]",list(int) -> list(int)
+2147,index-k with k=4,"([10, 5, 2, 16, 10, 1, 9, 16, 8, 11, 16],)",16,list(int) -> int
+2148,slice-k-n with k=5 and n=1,"([9, 8, 9, 8, 14, 11, 12, 14, 12, 14, 8],)",[14],list(int) -> list(int)
+2149,is-evens,"([8, 3],)",False,list(int) -> bool
+2150,append-index-k with k=4,"([8, 13, 11, 9, 0, 13, 6, 16, 12],)","[8, 13, 11, 9, 0, 13, 6, 16, 12, 9]",list(int) -> list(int)
+2151,odds,"([1, 1, 3],)","[1, 1, 3]",list(int) -> list(int)
+2152,bool-identify-is-mod-k with k=1,"([6, 8, 6, 14, 11, 4, 15],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2153,repeat-k with k=4,"([6, 5],)","[6, 5, 6, 5, 6, 5, 6, 5]",list(int) -> list(int)
+2154,drop-k with k=4,"([7, 16, 6, 13, 16, 4, 7],)","[16, 4, 7]",list(int) -> list(int)
+2155,append-k with k=5,"([3, 1, 4, 9],)","[3, 1, 4, 9, 5]",list(int) -> list(int)
+2156,slice-k-n with k=1 and n=5,"([8, 10, 7, 16, 3, 14, 0],)","[8, 10, 7, 16, 3]",list(int) -> list(int)
+2157,prepend-k with k=5,"([4, 16, 2],)","[5, 4, 16, 2]",list(int) -> list(int)
+2158,slice-k-n with k=2 and n=1,"([12, 10, 1, 9, 6],)",[10],list(int) -> list(int)
+2159,remove-index-k with k=1,"([4, 8, 11, 0, 8, 11],)","[8, 11, 0, 8, 11]",list(int) -> list(int)
+2160,is-evens,"([26, 20, 32, 10, 16, 16, 12],)",True,list(int) -> bool
+2161,keep eq 2,"([3, 6, 6, 5, 1],)",[],list(int) -> list(int)
+2162,count-k with k=2,"([3],)",0,list(int) -> int
+2163,remove-mod-k with k=4,"([10, 14],)","[10, 14]",list(int) -> list(int)
+2164,caesar-cipher-k-modulo-n with k=2 and n=5,"([0],)",[2],list(int) -> list(int)
+2165,has-k with k=3,"([3, 15],)",True,list(int) -> bool
+2166,mult-k with k=2,"([14],)",[28],list(int) -> list(int)
+2167,min,"([16, 11, 13],)",11,list(int) -> int
+2168,bool-identify-geq-k with k=5,"([3, 3, 12],)","[False, False, True]",list(int) -> list(bool)
+2169,keep-mod-k with k=5,"([10, 7, 0],)","[10, 0]",list(int) -> list(int)
+2170,empty,"([4, 7, 16, 11, 10, 3, 15],)",False,list(int) -> bool
+2171,bool-identify-k with k=5,"([1, 6],)","[False, False]",list(int) -> list(bool)
+2172,drop-k with k=5,"([9, 15, 0, 1, 8, 6, 2, 11, 4, 11],)","[6, 2, 11, 4, 11]",list(int) -> list(int)
+2173,bool-identify-k with k=4,"([4, 13, 10, 4, 4, 4],)","[True, False, False, True, True, True]",list(int) -> list(bool)
+2174,is-mod-k with k=1,"([4, 7, 16, 11, 10, 3, 15],)",True,list(int) -> bool
+2175,remove gt 2,"([6, 6, 2, 5, 1],)","[2, 1]",list(int) -> list(int)
+2176,rotate-k with k=2,"([7, 1, 6, 5, 14, 14, 0, 5, 6],)","[5, 6, 7, 1, 6, 5, 14, 14, 0]",list(int) -> list(int)
+2177,caesar-cipher-k-modulo-n with k=4 and n=3,"([0, 0, 0, 2, 2],)","[1, 1, 1, 0, 0]",list(int) -> list(int)
+2178,mult-k with k=0,"([5, 15, 8, 6],)","[0, 0, 0, 0]",list(int) -> list(int)
+2179,append-k with k=0,"([14, 1, 4, 15, 11],)","[14, 1, 4, 15, 11, 0]",list(int) -> list(int)
+2180,caesar-cipher-k-modulo-n with k=5 and n=4,"([0, 3, 2, 2, 2],)","[1, 0, 3, 3, 3]",list(int) -> list(int)
+2181,bool-identify-k with k=1,"([],)",[],list(int) -> list(bool)
+2182,rotate-k with k=1,"([1, 14, 6, 2, 2, 13, 5, 7, 3, 4, 9, 6, 4, 11],)","[11, 1, 14, 6, 2, 2, 13, 5, 7, 3, 4, 9, 6, 4]",list(int) -> list(int)
+2183,prepend-index-k with k=3,"([11, 10, 3, 14, 0, 5],)","[3, 11, 10, 3, 14, 0, 5]",list(int) -> list(int)
+2184,slice-k-n with k=3 and n=4,"([9, 1, 10, 0, 14, 12, 5, 1, 12],)","[10, 0, 14, 12]",list(int) -> list(int)
+2185,prepend-k with k=0,"([6, 9, 8, 16, 1, 2],)","[0, 6, 9, 8, 16, 1, 2]",list(int) -> list(int)
+2186,append-index-k with k=5,"([12, 4, 7, 10, 13, 3, 14, 4, 12, 4],)","[12, 4, 7, 10, 13, 3, 14, 4, 12, 4, 13]",list(int) -> list(int)
+2187,index-k with k=3,"([8, 12, 0, 1],)",0,list(int) -> int
+2188,slice-k-n with k=5 and n=1,"([7, 14, 4, 6, 15, 10, 14, 8],)",[15],list(int) -> list(int)
+2189,mult-k with k=5,"([0, 15, 5, 10, 8, 14, 12],)","[0, 75, 25, 50, 40, 70, 60]",list(int) -> list(int)
+2190,caesar-cipher-k-modulo-n with k=4 and n=5,"([],)",[],list(int) -> list(int)
+2191,repeat-many,"([0, 11, 11, 2],)",[],list(int) -> list(int)
+2192,reverse,"([2],)",[2],list(int) -> list(int)
+2193,kth-largest with k=5,"([3, 16, 14, 5, 10, 1, 5, 6],)",5,list(int) -> int
+2194,kth-smallest with k=1,"([2, 8, 12],)",2,list(int) -> int
+2195,index-k with k=4,"([1, 11, 7, 2, 5, 9, 11, 13, 2, 9],)",2,list(int) -> int
+2196,count-k with k=0,"([16, 15, 11],)",0,list(int) -> int
+2197,is-mod-k with k=4,"([],)",True,list(int) -> bool
+2198,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 3, 1],)","[0, 1, 3]",list(int) -> list(int)
+2199,is-evens,"([14, 10, 4, 0, 12, 6],)",True,list(int) -> bool
+2200,caesar-cipher-k-modulo-n with k=2 and n=3,"([0, 0],)","[2, 2]",list(int) -> list(int)
+2201,drop-k with k=5,"([0, 8, 7, 16, 13, 3, 8, 0, 13],)","[3, 8, 0, 13]",list(int) -> list(int)
+2202,is-mod-k with k=1,"([2, 16, 2, 5, 15, 6, 7],)",True,list(int) -> bool
+2203,caesar-cipher-k-modulo-n with k=5 and n=2,"([],)",[],list(int) -> list(int)
+2204,replace-all-with-index-k with k=5,"([13, 1, 15, 8, 5, 3, 10, 11, 6, 8],)","[5, 5, 5, 5, 5, 5, 5, 5, 5, 5]",list(int) -> list(int)
+2205,slice-k-n with k=5 and n=5,"([10, 9, 6, 15, 6, 12, 6, 7, 5, 9, 6, 5, 13],)","[6, 12, 6, 7, 5]",list(int) -> list(int)
+2206,pow-k with k=5,"([],)",[],list(int) -> list(int)
+2207,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 1, 0, 1, 1, 0, 0],)","[0, 0, 1, 0, 0, 1, 1]",list(int) -> list(int)
+2208,slice-k-n with k=3 and n=4,"([4, 11, 16, 9, 3, 9, 3, 5, 8, 8, 12, 11, 0, 6],)","[16, 9, 3, 9]",list(int) -> list(int)
+2209,max,"([4, 13, 4, 2],)",13,list(int) -> int
+2210,is-mod-k with k=4,"([8],)",True,list(int) -> bool
+2211,rotate-k with k=1,"([0, 1, 15, 10, 14, 4, 10, 1, 3, 13],)","[13, 0, 1, 15, 10, 14, 4, 10, 1, 3]",list(int) -> list(int)
+2212,last,"([1, 2, 3],)",3,list(int) -> int
+2213,append-k with k=0,"([15, 16],)","[15, 16, 0]",list(int) -> list(int)
+2214,replace-all-with-index-k with k=4,"([12, 11, 1, 13, 14, 2, 11, 6, 6, 5, 6],)","[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+2215,rotate-k with k=1,"([1, 13, 14, 2, 11, 6, 6, 5, 6, 13, 16, 7, 6, 13],)","[13, 1, 13, 14, 2, 11, 6, 6, 5, 6, 13, 16, 7, 6]",list(int) -> list(int)
+2216,slice-k-n with k=1 and n=3,"([5, 15, 11, 2, 8, 15, 4, 11, 1, 16, 10, 13],)","[5, 15, 11]",list(int) -> list(int)
+2217,last,"([8],)",8,list(int) -> int
+2218,rotate-k with k=4,"([10, 8, 6, 7, 15, 2, 9, 16, 16, 4, 0, 3, 4, 9, 2],)","[3, 4, 9, 2, 10, 8, 6, 7, 15, 2, 9, 16, 16, 4, 0]",list(int) -> list(int)
+2219,slice-k-n with k=2 and n=1,"([9, 13, 15, 7, 10],)",[13],list(int) -> list(int)
+2220,kth-smallest with k=3,"([15, 6, 5, 2, 13, 14, 5, 12, 6],)",5,list(int) -> int
+2221,slice-k-n with k=2 and n=5,"([11, 10, 12, 11, 11, 0, 5, 1, 8, 0],)","[10, 12, 11, 11, 0]",list(int) -> list(int)
+2222,remove-index-k with k=1,"([13, 4, 11, 10, 5],)","[4, 11, 10, 5]",list(int) -> list(int)
+2223,caesar-cipher-k-modulo-n with k=5 and n=3,"([1, 2, 0, 2, 1],)","[0, 1, 2, 1, 0]",list(int) -> list(int)
+2224,caesar-cipher-k-modulo-n with k=1 and n=2,"([],)",[],list(int) -> list(int)
+2225,has-k with k=4,"([4, 4, 9, 16, 4, 4, 4],)",True,list(int) -> bool
+2226,count-k with k=1,"([15, 16],)",0,list(int) -> int
+2227,drop-k with k=5,"([1, 8, 14, 3, 14, 3, 15, 11, 11, 14],)","[3, 15, 11, 11, 14]",list(int) -> list(int)
+2228,+1 maximum list,"([1, 3],)",4,list(int) -> int
+2229,take-k with k=3,"([1, 2, 0, 13, 7, 10, 12, 4],)","[1, 2, 0]",list(int) -> list(int)
+2230,keep eq 1,"([6, 4, 1, 4, 5],)",[1],list(int) -> list(int)
+2231,take-k with k=4,"([0, 6, 11, 0, 7, 6, 0, 10, 9, 6, 6],)","[0, 6, 11, 0]",list(int) -> list(int)
+2232,replace-all-with-index-k with k=3,"([5, 15, 7, 9, 9, 5, 10, 5],)","[7, 7, 7, 7, 7, 7, 7, 7]",list(int) -> list(int)
+2233,kth-largest with k=1,"([12, 0],)",12,list(int) -> int
+2234,keep-mod-k with k=4,"([4, 2],)",[4],list(int) -> list(int)
+2235,rotate-k with k=3,"([2, 11, 6, 10, 14, 2, 14, 3, 15, 14, 3, 5, 15, 0, 1, 15, 1],)","[1, 15, 1, 2, 11, 6, 10, 14, 2, 14, 3, 15, 14, 3, 5, 15, 0]",list(int) -> list(int)
+2236,keep gt 0,"([1, 5, 2, 4, 0],)","[1, 5, 2, 4]",list(int) -> list(int)
+2237,slice-k-n with k=1 and n=3,"([7, 7, 11, 5, 16],)","[7, 7, 11]",list(int) -> list(int)
+2238,min,"([9, 9, 2, 11],)",2,list(int) -> int
+2239,rotate-k with k=2,"([8, 9, 7, 10, 8, 8, 6, 12],)","[6, 12, 8, 9, 7, 10, 8, 8]",list(int) -> list(int)
+2240,drop-k with k=2,"([2, 14, 1],)",[1],list(int) -> list(int)
+2241,is-mod-k with k=4,"([24, 20, 0, 28],)",True,list(int) -> bool
+2242,keep squares,"([9, 9, 16, 0, 9, 0, 1],)","[9, 9, 16, 0, 9, 0, 1]",list(int) -> list(int)
+2243,append-index-k with k=3,"([8, 6, 13, 11, 15, 2],)","[8, 6, 13, 11, 15, 2, 13]",list(int) -> list(int)
+2244,rotate-k with k=1,"([16, 15, 10, 15, 5, 16, 9, 7, 9, 11, 2, 2],)","[2, 16, 15, 10, 15, 5, 16, 9, 7, 9, 11, 2]",list(int) -> list(int)
+2245,count-k with k=1,"([8, 7],)",0,list(int) -> int
+2246,keep-mod-k with k=5,"([2, 20],)",[20],list(int) -> list(int)
+2247,caesar-cipher-k-modulo-n with k=2 and n=3,"([0],)",[2],list(int) -> list(int)
+2248,slice-k-n with k=5 and n=2,"([5, 3, 5, 12, 1, 7, 15, 12, 6, 1, 8, 15, 5, 2, 16],)","[1, 7]",list(int) -> list(int)
+2249,bool-identify-k with k=2,"([8],)",[False],list(int) -> list(bool)
+2250,bool-identify-k with k=3,"([11, 0, 3, 3, 3, 3, 3],)","[False, False, True, True, True, True, True]",list(int) -> list(bool)
+2251,prepend-index-k with k=4,"([8, 15, 10, 13, 3, 12, 0, 7, 5, 2, 5],)","[13, 8, 15, 10, 13, 3, 12, 0, 7, 5, 2, 5]",list(int) -> list(int)
+2252,has-k with k=4,"([7, 3, 14, 6, 3],)",False,list(int) -> bool
+2253,bool-identify-geq-k with k=2,"([],)",[],list(int) -> list(bool)
+2254,is-mod-k with k=2,"([13],)",False,list(int) -> bool
+2255,keep gt 1,"([3, 3, 3, 2, 5],)","[3, 3, 3, 2, 5]",list(int) -> list(int)
+2256,kth-largest with k=3,"([14, 0, 7, 11, 10, 0, 5, 2],)",10,list(int) -> int
+2257,caesar-cipher-k-modulo-n with k=3 and n=4,"([3, 2, 2, 1, 2, 1],)","[2, 1, 1, 0, 1, 0]",list(int) -> list(int)
+2258,slice-k-n with k=4 and n=2,"([6, 6, 14, 11, 16, 9, 5, 16],)","[11, 16]",list(int) -> list(int)
+2259,slice-k-n with k=5 and n=2,"([6, 13, 14, 5, 13, 15, 16, 5, 8, 3, 15, 2, 0, 12, 6],)","[13, 15]",list(int) -> list(int)
+2260,take-k with k=4,"([14, 12, 6, 14, 16, 4],)","[14, 12, 6, 14]",list(int) -> list(int)
+2261,pow-k with k=5,"([15, 4, 8, 1, 0, 10],)","[759375, 1024, 32768, 1, 0, 100000]",list(int) -> list(int)
+2262,empty,"([10, 10, 6, 13, 4],)",False,list(int) -> bool
+2263,slice-k-n with k=4 and n=5,"([13, 11, 11, 9, 11, 2, 7, 2, 7, 2, 0, 12, 10, 4, 14, 11, 15],)","[9, 11, 2, 7, 2]",list(int) -> list(int)
+2264,repeat-k with k=4,"([15, 10, 10, 8],)","[15, 10, 10, 8, 15, 10, 10, 8, 15, 10, 10, 8, 15, 10, 10, 8]",list(int) -> list(int)
+2265,slice-k-n with k=3 and n=4,"([15, 10, 1, 10, 15, 13, 5, 4, 3, 12, 0, 5, 1, 9, 4],)","[1, 10, 15, 13]",list(int) -> list(int)
+2266,mult-k with k=4,"([4, 14],)","[16, 56]",list(int) -> list(int)
+2267,sum,"([1, 1, 2, 1],)",5,list(int) -> int
+2268,remove-index-k with k=5,"([2, 3, 11, 8, 10],)","[2, 3, 11, 8]",list(int) -> list(int)
+2269,kth-smallest with k=1,"([1],)",1,list(int) -> int
+2270,remove-mod-k with k=5,"([14, 16, 10, 9, 6],)","[14, 16, 9, 6]",list(int) -> list(int)
+2271,slice-k-n with k=1 and n=2,"([5, 8, 2, 6, 12, 8],)","[5, 8]",list(int) -> list(int)
+2272,rotate-k with k=1,"([7, 10, 4, 14, 4, 16, 1, 8, 4, 7, 6, 0, 2, 0, 7, 8],)","[8, 7, 10, 4, 14, 4, 16, 1, 8, 4, 7, 6, 0, 2, 0, 7]",list(int) -> list(int)
+2273,index-k with k=5,"([4, 7, 13, 6, 12],)",12,list(int) -> int
+2274,sort-and-deduplicate,"([8, 9, 6],)","[6, 8, 9]",list(int) -> list(int)
+2275,evens,"([5, 5, 8, 7, 4, 16],)","[8, 4, 16]",list(int) -> list(int)
+2276,slice-k-n with k=4 and n=2,"([6, 7, 9, 2, 4, 16, 11],)","[2, 4]",list(int) -> list(int)
+2277,range +1 maximum list,"([7, 5],)","[0, 1, 2, 3, 4, 5, 6, 7]",list(int) -> list(int)
+2278,remove eq 1,"([4, 2, 0, 3, 3],)","[4, 2, 0, 3, 3]",list(int) -> list(int)
+2279,index-k with k=2,"([0, 8, 11, 16, 14, 13, 8],)",8,list(int) -> int
+2280,slice-k-n with k=1 and n=5,"([3, 14, 10, 13, 16, 6, 1, 14, 12, 3, 12, 15, 5],)","[3, 14, 10, 13, 16]",list(int) -> list(int)
+2281,empty,"([7, 7, 3, 2],)",False,list(int) -> bool
+2282,count-k with k=0,"([0, 0, 0],)",3,list(int) -> int
+2283,append-k with k=1,"([8],)","[8, 1]",list(int) -> list(int)
+2284,replace-all-with-index-k with k=3,"([2, 8, 0, 11, 14, 13, 12, 10, 1, 15],)","[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+2285,remove-index-k with k=2,"([13, 3, 7],)","[13, 7]",list(int) -> list(int)
+2286,prepend-k with k=0,"([4, 14, 11, 0],)","[0, 4, 14, 11, 0]",list(int) -> list(int)
+2287,empty,"([6, 0, 14, 0, 2, 12],)",False,list(int) -> bool
+2288,drop-k with k=5,"([5, 10, 1, 4, 3, 5, 6, 0, 6, 3, 16],)","[5, 6, 0, 6, 3, 16]",list(int) -> list(int)
+2289,caesar-cipher-k-modulo-n with k=3 and n=5,"([],)",[],list(int) -> list(int)
+2290,remove gt 1,"([6, 3, 1, 4, 5],)",[1],list(int) -> list(int)
+2291,slice-k-n with k=4 and n=2,"([10, 4, 13, 5, 6, 10, 8, 2, 4, 2],)","[5, 6]",list(int) -> list(int)
+2292,remove-mod-k with k=3,"([1, 1],)","[1, 1]",list(int) -> list(int)
+2293,remove gt 2,"([4, 0, 2, 2, 4],)","[0, 2, 2]",list(int) -> list(int)
+2294,slice-k-n with k=5 and n=2,"([9, 4, 5, 8, 0, 4, 2, 11],)","[0, 4]",list(int) -> list(int)
+2295,keep gt 3,"([2, 6, 5, 2, 0],)","[6, 5]",list(int) -> list(int)
+2296,mult-k with k=5,"([12],)",[60],list(int) -> list(int)
+2297,count-k with k=0,"([],)",0,list(int) -> int
+2298,modulo-k with k=3,"([14, 15],)","[2, 0]",list(int) -> list(int)
+2299,keep eq 0,"([5, 3, 1, 0, 0],)","[0, 0]",list(int) -> list(int)
+2300,caesar-cipher-k-modulo-n with k=5 and n=4,"([3, 1, 2, 1, 1],)","[0, 2, 3, 2, 2]",list(int) -> list(int)
+2301,repeat-k with k=5,"([6, 15, 12, 9],)","[6, 15, 12, 9, 6, 15, 12, 9, 6, 15, 12, 9, 6, 15, 12, 9, 6, 15, 12, 9]",list(int) -> list(int)
+2302,is-odds,"([1, 7, 3],)",True,list(int) -> bool
+2303,caesar-cipher-k-modulo-n with k=5 and n=4,"([3, 2, 1, 3, 3],)","[0, 3, 2, 0, 0]",list(int) -> list(int)
+2304,prepend-index-k with k=4,"([10, 12, 16, 3, 6, 16, 5, 3, 16, 14, 7],)","[3, 10, 12, 16, 3, 6, 16, 5, 3, 16, 14, 7]",list(int) -> list(int)
+2305,prepend-index-k with k=3,"([11, 3, 1, 8, 15, 7, 7, 14, 1],)","[1, 11, 3, 1, 8, 15, 7, 7, 14, 1]",list(int) -> list(int)
+2306,replace-all-with-index-k with k=3,"([5, 11, 5, 1, 16, 1],)","[5, 5, 5, 5, 5, 5]",list(int) -> list(int)
+2307,has-k with k=0,"([13],)",False,list(int) -> bool
+2308,keep eq 2,"([6, 6, 2, 0, 6],)",[2],list(int) -> list(int)
+2309,is-mod-k with k=2,"([14],)",True,list(int) -> bool
+2310,take-k with k=1,"([15, 8, 10, 14, 15, 5, 11],)",[15],list(int) -> list(int)
+2311,count-k with k=5,"([5, 16, 11, 5],)",2,list(int) -> int
+2312,keep gt 1,"([3, 0, 0, 6, 1],)","[3, 6]",list(int) -> list(int)
+2313,append-k with k=0,"([3, 5],)","[3, 5, 0]",list(int) -> list(int)
+2314,bool-identify-is-prime,"([12],)",[False],list(int) -> list(bool)
+2315,max,"([4, 12],)",12,list(int) -> int
+2316,fibonacci,"(2,)",1,int -> int
+2317,keep squares,"([1, 1, 16, 6, 2, 0, 0],)","[1, 1, 16, 0, 0]",list(int) -> list(int)
+2318,slice-k-n with k=5 and n=1,"([9, 1, 14, 12, 11, 7, 8],)",[11],list(int) -> list(int)
+2319,bool-identify-k with k=0,"([11, 9, 0],)","[False, False, True]",list(int) -> list(bool)
+2320,bool-identify-geq-k with k=5,"([1, 1, 7, 1],)","[False, False, True, False]",list(int) -> list(bool)
+2321,index-k with k=1,"([1, 12, 4, 0, 0, 14, 14, 14],)",1,list(int) -> int
+2322,kth-smallest with k=2,"([13, 3, 7],)",7,list(int) -> int
+2323,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 3, 2],)","[3, 0, 3]",list(int) -> list(int)
+2324,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 1, 0, 0, 1, 0, 0],)","[0, 0, 2, 2, 0, 2, 2]",list(int) -> list(int)
+2325,remove eq 3,"([5, 2, 6, 3, 0],)","[5, 2, 6, 0]",list(int) -> list(int)
+2326,caesar-cipher-k-modulo-n with k=5 and n=3,"([2],)",[1],list(int) -> list(int)
+2327,bool-identify-is-mod-k with k=1,"([13, 7, 9, 10],)","[True, True, True, True]",list(int) -> list(bool)
+2328,slice-k-n with k=3 and n=1,"([16, 9, 5, 7, 3, 5, 12, 1],)",[5],list(int) -> list(int)
+2329,slice-k-n with k=3 and n=5,"([16, 11, 0, 8, 5, 11, 15, 6, 12],)","[0, 8, 5, 11, 15]",list(int) -> list(int)
+2330,add-k with k=1,"([6, 2, 13],)","[7, 3, 14]",list(int) -> list(int)
+2331,sort-and-deduplicate,"([9, 0, 1],)","[0, 1, 9]",list(int) -> list(int)
+2332,append-index-k with k=2,"([14, 12, 12, 15, 5, 12, 2, 8, 2],)","[14, 12, 12, 15, 5, 12, 2, 8, 2, 12]",list(int) -> list(int)
+2333,repeat-k with k=4,"([6, 0, 12, 11, 3],)","[6, 0, 12, 11, 3, 6, 0, 12, 11, 3, 6, 0, 12, 11, 3, 6, 0, 12, 11, 3]",list(int) -> list(int)
+2334,append-k with k=0,"([0, 14],)","[0, 14, 0]",list(int) -> list(int)
+2335,remove-index-k with k=4,"([6, 7, 13, 8, 13, 16, 7, 10],)","[6, 7, 13, 13, 16, 7, 10]",list(int) -> list(int)
+2336,slice-k-n with k=5 and n=3,"([11, 10, 6, 3, 9, 6, 16, 14, 12, 2, 2],)","[9, 6, 16]",list(int) -> list(int)
+2337,slice-k-n with k=4 and n=1,"([13, 16, 7, 9, 12, 14, 2, 9],)",[9],list(int) -> list(int)
+2338,repeat-k with k=3,"([11, 10],)","[11, 10, 11, 10, 11, 10]",list(int) -> list(int)
+2339,keep-mod-k with k=4,"([8],)",[8],list(int) -> list(int)
+2340,prepend-index-k with k=1,"([16, 0, 8],)","[16, 16, 0, 8]",list(int) -> list(int)
+2341,remove empty lists,"([[False, True, True], [False], [], []],)","[[False, True, True], [False]]",list(list(bool)) -> list(list(bool))
+2342,kth-largest with k=4,"([16, 4, 13, 11, 6, 13, 16, 1, 5, 6],)",13,list(int) -> int
+2343,count-k with k=1,"([16, 6, 8, 13, 14],)",0,list(int) -> int
+2344,append-k with k=1,"([],)",[1],list(int) -> list(int)
+2345,slice-k-n with k=4 and n=2,"([9, 10, 10, 3, 9, 11, 10, 2, 9, 0, 5],)","[3, 9]",list(int) -> list(int)
+2346,kth-smallest with k=3,"([1, 14, 9, 7, 11, 16],)",9,list(int) -> int
+2347,keep eq 1,"([4, 0, 2, 4, 0],)",[],list(int) -> list(int)
+2348,caesar-cipher-k-modulo-n with k=2 and n=5,"([],)",[],list(int) -> list(int)
+2349,is-mod-k with k=3,"([8, 12, 4, 7],)",False,list(int) -> bool
+2350,index-k with k=3,"([6, 2, 6, 12],)",6,list(int) -> int
+2351,caesar-cipher-k-modulo-n with k=5 and n=4,"([2, 0, 0, 2, 1, 0],)","[3, 1, 1, 3, 2, 1]",list(int) -> list(int)
+2352,bool-identify-geq-k with k=4,"([7],)",[True],list(int) -> list(bool)
+2353,is-mod-k with k=5,"([3, 12, 12, 15, 2, 4],)",False,list(int) -> bool
+2354,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 1, 1, 1, 0],)","[0, 0, 0, 0, 1]",list(int) -> list(int)
+2355,slice-k-n with k=2 and n=5,"([8, 10, 0, 3, 8, 5, 1, 7, 4, 2, 7, 14, 16],)","[10, 0, 3, 8, 5]",list(int) -> list(int)
+2356,count-head-in-tail,"([1, 1, 2],)",1,list(int) -> int
+2357,slice-k-n with k=3 and n=4,"([13, 11, 15, 0, 16, 16, 1, 2, 16, 11, 2, 13, 14],)","[15, 0, 16, 16]",list(int) -> list(int)
+2358,drop-k with k=3,"([9, 0, 5, 8, 5, 8, 13],)","[8, 5, 8, 13]",list(int) -> list(int)
+2359,bool-identify-is-mod-k with k=5,"([0, 7, 3, 15, 11, 1],)","[True, False, False, True, False, False]",list(int) -> list(bool)
+2360,pop,"([9, 14],)",[9],list(int) -> list(int)
+2361,remove-index-k with k=3,"([10, 5, 9],)","[10, 5]",list(int) -> list(int)
+2362,keep eq 0,"([0, 4, 5, 4, 1],)",[0],list(int) -> list(int)
+2363,bool-identify-geq-k with k=1,"([6, 0, 1],)","[True, False, True]",list(int) -> list(bool)
+2364,remove-index-k with k=5,"([3, 3, 16, 6, 16, 4, 1],)","[3, 3, 16, 6, 4, 1]",list(int) -> list(int)
+2365,bool-identify-is-mod-k with k=3,"([],)",[],list(int) -> list(bool)
+2366,bool-identify-is-mod-k with k=1,"([10, 0, 15, 9, 13],)","[True, True, True, True, True]",list(int) -> list(bool)
+2367,empty,"([0],)",False,list(int) -> bool
+2368,bool-identify-k with k=3,"([5, 16, 12],)","[False, False, False]",list(int) -> list(bool)
+2369,slice-k-n with k=2 and n=2,"([2, 14, 5, 16, 3, 7, 15, 3],)","[14, 5]",list(int) -> list(int)
+2370,slice-k-n with k=2 and n=2,"([0, 9, 16, 10, 16],)","[9, 16]",list(int) -> list(int)
+2371,remove-mod-k with k=4,"([],)",[],list(int) -> list(int)
+2372,product,"([15, 7],)",105,list(int) -> int
+2373,kth-largest with k=1,"([15, 8, 10, 1, 14, 1, 3],)",15,list(int) -> int
+2374,is-mod-k with k=1,"([14, 13, 12, 6],)",True,list(int) -> bool
+2375,slice-k-n with k=2 and n=2,"([2, 7, 11, 0, 2, 7, 2, 2, 10, 6, 0],)","[7, 11]",list(int) -> list(int)
+2376,prepend-index-k with k=1,"([0, 0, 8, 12],)","[0, 0, 0, 8, 12]",list(int) -> list(int)
+2377,bool-identify-geq-k with k=5,"([2, 13],)","[False, True]",list(int) -> list(bool)
+2378,prepend-index-k with k=2,"([10, 7, 8, 16, 16, 14, 8, 6, 2],)","[7, 10, 7, 8, 16, 16, 14, 8, 6, 2]",list(int) -> list(int)
+2379,slice-k-n with k=3 and n=4,"([2, 10, 13, 10, 15, 1, 0, 11, 0, 15, 3, 7, 4, 11],)","[13, 10, 15, 1]",list(int) -> list(int)
+2380,count-k with k=4,"([6, 4, 4, 0],)",2,list(int) -> int
+2381,prepend-k with k=0,"([1, 2, 5, 13, 1, 3],)","[0, 1, 2, 5, 13, 1, 3]",list(int) -> list(int)
+2382,remove eq 2,"([4, 3, 2, 6, 4],)","[4, 3, 6, 4]",list(int) -> list(int)
+2383,slice-k-n with k=3 and n=4,"([8, 10, 5, 12, 3, 8, 0, 16, 8, 2],)","[5, 12, 3, 8]",list(int) -> list(int)
+2384,modulo-k with k=1,"([1, 16, 6, 4, 6, 12],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+2385,keep primes,"([19, 8, 9, 17, 23, 17, 2],)","[19, 17, 23, 17, 2]",list(int) -> list(int)
+2386,remove gt 3,"([5, 3, 0, 2, 2],)","[3, 0, 2, 2]",list(int) -> list(int)
+2387,prepend-k with k=5,"([],)",[5],list(int) -> list(int)
+2388,is-mod-k with k=1,"([1, 13, 10, 13],)",True,list(int) -> bool
+2389,append-index-k with k=1,"([16, 2, 5],)","[16, 2, 5, 16]",list(int) -> list(int)
+2390,remove-index-k with k=3,"([5, 11, 2, 10, 13, 9, 13],)","[5, 11, 10, 13, 9, 13]",list(int) -> list(int)
+2391,caesar-cipher-k-modulo-n with k=5 and n=3,"([2, 0],)","[1, 2]",list(int) -> list(int)
+2392,index-k with k=4,"([1, 1, 7, 3, 11, 16, 4, 10, 7, 5, 7],)",3,list(int) -> int
+2393,caesar-cipher-k-modulo-n with k=4 and n=5,"([1, 2, 4, 1, 0],)","[0, 1, 3, 0, 4]",list(int) -> list(int)
+2394,remove-mod-k with k=5,"([6],)",[6],list(int) -> list(int)
+2395,slice-k-n with k=3 and n=4,"([0, 9, 14, 0, 7, 12, 14, 4, 7, 0, 12, 10],)","[14, 0, 7, 12]",list(int) -> list(int)
+2396,rotate-k with k=3,"([5, 4, 5, 2, 14, 6, 9, 15, 1, 1, 7, 3, 11],)","[7, 3, 11, 5, 4, 5, 2, 14, 6, 9, 15, 1, 1]",list(int) -> list(int)
+2397,remove-mod-head,"([1, 6, 12, 8, 1, 14, 9],)",[],list(int) -> list(int)
+2398,has-k with k=0,"([9, 0, 0, 0],)",True,list(int) -> bool
+2399,prepend-k with k=3,"([14, 11],)","[3, 14, 11]",list(int) -> list(int)
+2400,caesar-cipher-k-modulo-n with k=2 and n=3,"([1, 1, 2, 1, 2, 2, 2],)","[0, 0, 1, 0, 1, 1, 1]",list(int) -> list(int)
+2401,head,"([0, 5],)",0,list(int) -> int
+2402,bool-identify-is-mod-k with k=2,"([8, 15, 16, 15],)","[True, False, True, False]",list(int) -> list(bool)
+2403,count-head-in-tail,"([0, 5, 4, 0, 2],)",1,list(int) -> int
+2404,count-k with k=5,"([],)",0,list(int) -> int
+2405,index-head,"([1, 10, 1, 4],)",10,list(int) -> int
+2406,append-index-k with k=2,"([11, 5, 15, 11],)","[11, 5, 15, 11, 5]",list(int) -> list(int)
+2407,caesar-cipher-k-modulo-n with k=1 and n=3,"([2, 2, 2, 1],)","[0, 0, 0, 2]",list(int) -> list(int)
+2408,kth-smallest with k=3,"([10, 8, 7, 4, 2, 3, 12, 8],)",4,list(int) -> int
+2409,replace-all-with-index-k with k=1,"([11, 11, 6, 0, 10],)","[11, 11, 11, 11, 11]",list(int) -> list(int)
+2410,bool-identify-is-mod-k with k=5,"([5, 6, 2, 8, 9, 0, 2],)","[True, False, False, False, False, True, False]",list(int) -> list(bool)
+2411,replace-all-with-index-k with k=4,"([0, 4, 2, 5],)","[5, 5, 5, 5]",list(int) -> list(int)
+2412,slice-k-n with k=2 and n=5,"([15, 4, 13, 9, 10, 2, 9, 14, 4, 16],)","[4, 13, 9, 10, 2]",list(int) -> list(int)
+2413,modulo-k with k=3,"([6, 8, 2, 2],)","[0, 2, 2, 2]",list(int) -> list(int)
+2414,append-k with k=4,"([3],)","[3, 4]",list(int) -> list(int)
+2415,modulo-k with k=1,"([16, 15, 1, 12, 4, 0, 0],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+2416,modulo-k with k=4,"([4, 1, 1, 6, 8],)","[0, 1, 1, 2, 0]",list(int) -> list(int)
+2417,kth-smallest with k=3,"([10, 13, 9, 10, 8, 6, 7, 15, 2],)",7,list(int) -> int
+2418,remove-index-k with k=5,"([11, 16, 6, 0, 0, 8, 12],)","[11, 16, 6, 0, 8, 12]",list(int) -> list(int)
+2419,index-k with k=2,"([15, 3, 9, 14, 0, 2, 5],)",3,list(int) -> int
+2420,prepend-index-k with k=2,"([15, 14, 13],)","[14, 15, 14, 13]",list(int) -> list(int)
+2421,keep-mod-k with k=2,"([4, 9, 4, 4],)","[4, 4, 4]",list(int) -> list(int)
+2422,pow-k with k=3,"([7, 0, 3, 12, 12],)","[343, 0, 27, 1728, 1728]",list(int) -> list(int)
+2423,kth-smallest with k=1,"([12, 14, 13],)",12,list(int) -> int
+2424,caesar-cipher-k-modulo-n with k=2 and n=4,"([1, 3, 0],)","[3, 1, 2]",list(int) -> list(int)
+2425,dup,"([1],)","[1, 1]",list(int) -> list(int)
+2426,prepend-k with k=1,"([4, 16, 10, 8],)","[1, 4, 16, 10, 8]",list(int) -> list(int)
+2427,+1 maximum list,"([1, 8, 0],)",9,list(int) -> int
+2428,append-index-k with k=3,"([15, 13, 7, 2, 4, 10],)","[15, 13, 7, 2, 4, 10, 7]",list(int) -> list(int)
+2429,pow-k with k=2,"([7, 14, 11],)","[49, 196, 121]",list(int) -> list(int)
+2430,slice-k-n with k=2 and n=2,"([9, 5, 16, 1, 15, 12, 6, 7],)","[5, 16]",list(int) -> list(int)
+2431,append-index-k with k=4,"([8, 1, 16, 6, 16],)","[8, 1, 16, 6, 16, 6]",list(int) -> list(int)
+2432,bool-identify-is-prime,"([7, 6, 11],)","[True, False, True]",list(int) -> list(bool)
+2433,bool-identify-geq-k with k=3,"([4],)",[True],list(int) -> list(bool)
+2434,keep eq 0,"([2, 0, 0, 6, 1],)","[0, 0]",list(int) -> list(int)
+2435,keep gt 3,"([0, 3, 0, 6, 6],)","[6, 6]",list(int) -> list(int)
+2436,repeat,"([3, 7],)","[7, 7, 7]",list(int) -> list(int)
+2437,drop-k with k=4,"([7, 0, 3, 6, 10, 4],)","[10, 4]",list(int) -> list(int)
+2438,caesar-cipher-k-modulo-n with k=3 and n=5,"([1, 1],)","[4, 4]",list(int) -> list(int)
+2439,append-k with k=0,"([],)",[0],list(int) -> list(int)
+2440,count-k with k=4,"([4],)",1,list(int) -> int
+2441,bool-identify-geq-k with k=5,"([12, 10],)","[True, True]",list(int) -> list(bool)
+2442,slice-k-n with k=2 and n=4,"([9, 13, 11, 2, 6, 14, 11, 6, 8, 2, 7],)","[13, 11, 2, 6]",list(int) -> list(int)
+2443,index-head,"([2, 0, 15, 9, 10, 14],)",15,list(int) -> int
+2444,prepend-k with k=0,"([16, 11],)","[0, 16, 11]",list(int) -> list(int)
+2445,range +1 maximum list,"([1, 7, 4],)","[0, 1, 2, 3, 4, 5, 6, 7]",list(int) -> list(int)
+2446,tail,"([13, 2, 2, 13, 4, 3],)","[2, 2, 13, 4, 3]",list(int) -> list(int)
+2447,drop-k with k=3,"([10, 6, 5, 4, 15, 11, 8, 8],)","[4, 15, 11, 8, 8]",list(int) -> list(int)
+2448,keep-mod-k with k=4,"([0, 1, 2, 14, 3, 9, 12],)","[0, 12]",list(int) -> list(int)
+2449,index-k with k=4,"([4, 16, 5, 11, 11, 14],)",11,list(int) -> int
+2450,slice-k-n with k=2 and n=2,"([8, 7, 10, 6, 9],)","[7, 10]",list(int) -> list(int)
+2451,remove eq 1,"([2, 6, 5, 6, 4],)","[2, 6, 5, 6, 4]",list(int) -> list(int)
+2452,repeat-k with k=3,"([],)",[],list(int) -> list(int)
+2453,reverse,"([2, 5, 4, 2, 0, 5, 1, 1],)","[1, 1, 5, 0, 2, 4, 5, 2]",list(int) -> list(int)
+2454,keep-mod-k with k=4,"([24, 16, 28, 4, 0],)","[24, 16, 28, 4, 0]",list(int) -> list(int)
+2455,slice-k-n with k=3 and n=4,"([0, 5, 15, 2, 7, 11, 8, 4, 12, 2, 4],)","[15, 2, 7, 11]",list(int) -> list(int)
+2456,has-k with k=0,"([0, 0, 0],)",True,list(int) -> bool
+2457,has-k with k=4,"([9, 4, 3, 4],)",True,list(int) -> bool
+2458,append-k with k=0,"([5, 15, 4, 3],)","[5, 15, 4, 3, 0]",list(int) -> list(int)
+2459,append-k with k=0,"([7, 7, 13, 12],)","[7, 7, 13, 12, 0]",list(int) -> list(int)
+2460,modulo-k with k=1,"([4, 3, 7, 10, 4],)","[0, 0, 0, 0, 0]",list(int) -> list(int)
+2461,dup,"([4, 9, 2],)","[4, 4, 9, 9, 2, 2]",list(int) -> list(int)
+2462,keep-mod-head,"([4],)",[],list(int) -> list(int)
+2463,min,"([1, 1, 2, 1],)",1,list(int) -> int
+2464,count-head-in-tail,"([7],)",0,list(int) -> int
+2465,bool-identify-geq-k with k=3,"([2, 9, 2, 2, 2],)","[False, True, False, False, False]",list(int) -> list(bool)
+2466,keep gt 3,"([5, 5, 4, 1, 1],)","[5, 5, 4]",list(int) -> list(int)
+2467,mult-k with k=0,"([8],)",[0],list(int) -> list(int)
+2468,remove-index-k with k=2,"([14, 11],)",[14],list(int) -> list(int)
+2469,slice-k-n with k=2 and n=2,"([14, 11, 16, 5, 0, 0, 5],)","[11, 16]",list(int) -> list(int)
+2470,head,"([1, 2, 3],)",1,list(int) -> int
+2471,caesar-cipher-k-modulo-n with k=4 and n=5,"([],)",[],list(int) -> list(int)
+2472,count-k with k=3,"([2, 8, 0, 14, 3, 10],)",1,list(int) -> int
+2473,remove gt 1,"([2, 0, 5, 2, 0],)","[0, 0]",list(int) -> list(int)
+2474,index-k with k=5,"([9, 10, 2, 3, 5, 1, 8, 4, 3, 3, 16],)",5,list(int) -> int
+2475,remove-mod-k with k=3,"([0, 0, 7, 11, 27, 24, 7],)","[7, 11, 7]",list(int) -> list(int)
+2476,is-odds,"([31, 7, 19, 29, 1],)",True,list(int) -> bool
+2477,caesar-cipher-k-modulo-n with k=3 and n=2,"([0],)",[1],list(int) -> list(int)
+2478,reverse,"([15, 15, 11, 5, 3],)","[3, 5, 11, 15, 15]",list(int) -> list(int)
+2479,pow-k with k=4,"([6, 8, 1, 3],)","[1296, 4096, 1, 81]",list(int) -> list(int)
+2480,kth-smallest with k=2,"([9, 0, 0, 5, 14, 10, 5, 2],)",0,list(int) -> int
+2481,mult-k with k=5,"([8, 2, 14],)","[40, 10, 70]",list(int) -> list(int)
+2482,slice-k-n with k=5 and n=5,"([4, 4, 13, 12, 10, 10, 3, 2, 10, 4, 10, 1, 0, 4, 4],)","[10, 10, 3, 2, 10]",list(int) -> list(int)
+2483,count-k with k=1,"([3, 3, 5, 1, 13],)",1,list(int) -> int
+2484,add-k with k=3,"([7, 14, 1],)","[10, 17, 4]",list(int) -> list(int)
+2485,append-index-k with k=1,"([1, 4, 8, 4, 0, 16, 13],)","[1, 4, 8, 4, 0, 16, 13, 1]",list(int) -> list(int)
+2486,replace-all-with-index-k with k=5,"([13, 5, 3, 0, 9, 15, 1, 1],)","[9, 9, 9, 9, 9, 9, 9, 9]",list(int) -> list(int)
+2487,slice-k-n with k=2 and n=3,"([7, 15, 11, 10, 13, 6, 9, 7, 2, 9, 4, 6, 4],)","[15, 11, 10]",list(int) -> list(int)
+2488,index-k with k=5,"([16, 4, 1, 12, 3, 12, 15],)",3,list(int) -> int
+2489,slice-k-n with k=3 and n=5,"([12, 13, 2, 11, 3, 1, 16, 11, 4, 12, 2, 1, 1],)","[2, 11, 3, 1, 16]",list(int) -> list(int)
+2490,repeat-k with k=3,"([16, 6, 0, 0],)","[16, 6, 0, 0, 16, 6, 0, 0, 16, 6, 0, 0]",list(int) -> list(int)
+2491,prepend-k with k=3,"([13, 14, 10, 10, 14, 14],)","[3, 13, 14, 10, 10, 14, 14]",list(int) -> list(int)
+2492,rotate-k with k=2,"([10, 1, 13, 5, 13, 14, 7, 6, 6, 0],)","[6, 0, 10, 1, 13, 5, 13, 14, 7, 6]",list(int) -> list(int)
+2493,prepend-k with k=2,"([1, 12],)","[2, 1, 12]",list(int) -> list(int)
+2494,bool-identify-is-mod-k with k=5,"([5],)",[True],list(int) -> list(bool)
+2495,replace-all-with-index-k with k=3,"([4, 7, 15, 9, 4, 15, 3],)","[15, 15, 15, 15, 15, 15, 15]",list(int) -> list(int)
+2496,drop-k with k=3,"([13, 0, 5, 14, 1, 12, 1, 12, 5, 4],)","[14, 1, 12, 1, 12, 5, 4]",list(int) -> list(int)
+2497,index-k with k=1,"([6, 4, 6, 12, 0, 8, 1, 16],)",6,list(int) -> int
+2498,keep eq 2,"([6, 2, 5, 1, 4],)",[2],list(int) -> list(int)
+2499,has-k with k=4,"([9, 4, 4, 4, 4, 4],)",True,list(int) -> bool
+2500,prepend-k with k=5,"([8, 11, 7],)","[5, 8, 11, 7]",list(int) -> list(int)
+2501,kth-smallest with k=5,"([6, 7, 16, 16, 6, 6, 11, 5, 9],)",7,list(int) -> int
+2502,bool-identify-k with k=2,"([3, 8, 1],)","[False, False, False]",list(int) -> list(bool)
+2503,bool-identify-is-mod-k with k=5,"([2, 12, 11, 14, 15, 9, 8],)","[False, False, False, False, True, False, False]",list(int) -> list(bool)
+2504,bool-identify-is-prime,"([7, 7, 0],)","[True, True, False]",list(int) -> list(bool)
+2505,repeat-k with k=4,"([1, 3, 13],)","[1, 3, 13, 1, 3, 13, 1, 3, 13, 1, 3, 13]",list(int) -> list(int)
+2506,repeat-k with k=3,"([11, 14],)","[11, 14, 11, 14, 11, 14]",list(int) -> list(int)
+2507,pow-k with k=3,"([0, 15, 15, 16, 9],)","[0, 3375, 3375, 4096, 729]",list(int) -> list(int)
+2508,bool-identify-geq-k with k=3,"([0, 9, 0],)","[False, True, False]",list(int) -> list(bool)
+2509,keep eq 1,"([1, 0, 2, 1, 0],)","[1, 1]",list(int) -> list(int)
+2510,is-mod-k with k=1,"([6, 1, 13, 7],)",True,list(int) -> bool
+2511,range,"(3,)","[0, 1, 2]",int -> list(int)
+2512,modulo-k with k=1,"([],)",[],list(int) -> list(int)
+2513,repeat-k with k=3,"([2],)","[2, 2, 2]",list(int) -> list(int)
+2514,has-k with k=4,"([],)",False,list(int) -> bool
+2515,kth-smallest with k=5,"([1, 3, 13, 12, 5, 8, 13, 0, 13, 3],)",5,list(int) -> int
+2516,count-k with k=0,"([0, 0, 0, 14, 9],)",3,list(int) -> int
+2517,modulo-k with k=4,"([8, 14, 2, 12],)","[0, 2, 2, 0]",list(int) -> list(int)
+2518,rotate-k with k=5,"([7, 3, 14, 15, 8, 10, 9, 15, 9, 11, 13],)","[9, 15, 9, 11, 13, 7, 3, 14, 15, 8, 10]",list(int) -> list(int)
+2519,remove-index-k with k=4,"([0, 11, 12, 9, 15, 16, 0, 8],)","[0, 11, 12, 15, 16, 0, 8]",list(int) -> list(int)
+2520,pow-k with k=2,"([5, 6, 2, 8, 9],)","[25, 36, 4, 64, 81]",list(int) -> list(int)
+2521,mult-k with k=4,"([15],)",[60],list(int) -> list(int)
+2522,kth-largest with k=3,"([6, 5, 4, 15, 11, 8, 8],)",8,list(int) -> int
+2523,kth-smallest with k=1,"([13, 0, 3, 2, 9, 14],)",0,list(int) -> int
+2524,repeat-k with k=5,"([3, 15, 14, 3, 5],)","[3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5]",list(int) -> list(int)
+2525,keep squares,"([16, 16, 8, 0, 4, 7, 3],)","[16, 16, 0, 4]",list(int) -> list(int)
+2526,remove gt 3,"([1, 0, 0, 3, 0],)","[1, 0, 0, 3, 0]",list(int) -> list(int)
+2527,index-head,"([2, 3, 4],)",4,list(int) -> int
+2528,count-k with k=1,"([1, 1, 1],)",3,list(int) -> int
+2529,prepend-index-k with k=5,"([9, 14, 2, 7, 6, 8, 8],)","[6, 9, 14, 2, 7, 6, 8, 8]",list(int) -> list(int)
+2530,remove-mod-k with k=3,"([6, 3, 11, 12],)",[11],list(int) -> list(int)
+2531,drop-k with k=1,"([16],)",[],list(int) -> list(int)
+2532,bool-identify-k with k=1,"([1, 1, 1, 4, 1, 1],)","[True, True, True, False, True, True]",list(int) -> list(bool)
+2533,slice-k-n with k=4 and n=1,"([15, 12, 4, 9, 16, 11, 8],)",[9],list(int) -> list(int)
+2534,kth-largest with k=1,"([11, 2, 10, 10],)",11,list(int) -> int
+2535,bool-identify-geq-k with k=0,"([10, 16],)","[True, True]",list(int) -> list(bool)
+2536,append-k with k=1,"([4, 6],)","[4, 6, 1]",list(int) -> list(int)
+2537,kth-smallest with k=4,"([16, 13, 8, 3, 15, 0, 4, 2, 11],)",4,list(int) -> int
+2538,kth-smallest with k=4,"([6, 7, 13, 8, 13, 16, 7, 10],)",8,list(int) -> int
+2539,add-k with k=1,"([],)",[],list(int) -> list(int)
+2540,count-k with k=4,"([],)",0,list(int) -> int
+2541,prepend-k with k=1,"([16, 9, 10, 8, 8, 1, 0],)","[1, 16, 9, 10, 8, 8, 1, 0]",list(int) -> list(int)
+2542,slice-k-n with k=3 and n=3,"([9, 6, 3, 12, 2, 3, 11, 6, 2, 7, 11, 2, 13, 8],)","[3, 12, 2]",list(int) -> list(int)
+2543,drop-k with k=4,"([7, 4, 8, 1],)",[],list(int) -> list(int)
+2544,count-k with k=3,"([3, 3, 3, 4],)",3,list(int) -> int
+2545,kth-smallest with k=5,"([9, 11, 7, 13, 15, 10, 10, 8],)",10,list(int) -> int
+2546,modulo-k with k=5,"([7, 15],)","[2, 0]",list(int) -> list(int)
+2547,keep gt 0,"([2, 6, 3, 5, 2],)","[2, 6, 3, 5, 2]",list(int) -> list(int)
+2548,modulo-k with k=3,"([9, 0, 3],)","[0, 0, 0]",list(int) -> list(int)
+2549,replace-all-with-index-k with k=5,"([10, 16, 9, 13, 14, 13],)","[14, 14, 14, 14, 14, 14]",list(int) -> list(int)
+2550,fibonacci,"(13,)",233,int -> int
+2551,kth-smallest with k=2,"([12, 5, 0, 10],)",5,list(int) -> int
+2552,kth-largest with k=3,"([7, 11, 12, 8, 15, 1, 9, 2],)",11,list(int) -> int
+2553,slice-k-n with k=4 and n=3,"([9, 7, 14, 3, 6, 10, 6, 8, 1],)","[3, 6, 10]",list(int) -> list(int)
+2554,take-k with k=5,"([0, 11, 10, 16, 9, 2, 6],)","[0, 11, 10, 16, 9]",list(int) -> list(int)
+2555,product,"([6],)",6,list(int) -> int
+2556,slice-k-n with k=1 and n=4,"([14, 4, 5, 8, 14, 12, 15, 2, 14, 0, 8, 12, 11],)","[14, 4, 5, 8]",list(int) -> list(int)
+2557,repeat-many,"([0, 10, 11],)",[],list(int) -> list(int)
+2558,drop-k with k=1,"([15, 8, 10, 1, 14, 1, 3],)","[8, 10, 1, 14, 1, 3]",list(int) -> list(int)
+2559,append-k with k=5,"([2, 13],)","[2, 13, 5]",list(int) -> list(int)
+2560,slice-k-n with k=1 and n=1,"([12, 0, 13, 16, 10],)",[12],list(int) -> list(int)
+2561,bool-identify-k with k=3,"([3, 6, 1, 15, 12, 13],)","[True, False, False, False, False, False]",list(int) -> list(bool)
+2562,slice-k-n with k=1 and n=4,"([12, 3, 1, 10, 12, 2, 13, 5, 5],)","[12, 3, 1, 10]",list(int) -> list(int)
+2563,repeat-k with k=2,"([13],)","[13, 13]",list(int) -> list(int)
+2564,min,"([3, 6, 7, 6, 8],)",3,list(int) -> int
+2565,remove-index-k with k=3,"([9, 10, 8, 6, 7, 15, 2, 9, 16],)","[9, 10, 6, 7, 15, 2, 9, 16]",list(int) -> list(int)
+2566,remove gt 2,"([5, 6, 1, 5, 5],)",[1],list(int) -> list(int)
+2567,remove-mod-k with k=3,"([5, 3, 11],)","[5, 11]",list(int) -> list(int)
+2568,bool-identify-is-mod-k with k=2,"([2, 2, 2],)","[True, True, True]",list(int) -> list(bool)
+2569,remove gt 1,"([6, 1, 0, 5, 3],)","[1, 0]",list(int) -> list(int)
+2570,caesar-cipher-k-modulo-n with k=3 and n=4,"([0, 1, 1, 1, 1, 2],)","[3, 0, 0, 0, 0, 1]",list(int) -> list(int)
+2571,slice-k-n with k=4 and n=2,"([8, 11, 3, 5, 1, 14, 8, 3, 14, 11, 16, 1, 7],)","[5, 1]",list(int) -> list(int)
+2572,count-k with k=1,"([1, 1, 1, 1],)",4,list(int) -> int
+2573,remove gt 2,"([5, 5, 3, 5, 4],)",[],list(int) -> list(int)
+2574,drop-k with k=1,"([12, 0],)",[0],list(int) -> list(int)
+2575,kth-smallest with k=1,"([0, 10, 4, 11, 14],)",0,list(int) -> int
+2576,replace-all-with-index-k with k=3,"([0, 1, 4, 13, 14],)","[4, 4, 4, 4, 4]",list(int) -> list(int)
+2577,bool-identify-is-mod-k with k=2,"([9, 2, 2, 8],)","[False, True, True, True]",list(int) -> list(bool)
+2578,rotate-k with k=4,"([16, 11, 13, 11, 3, 1, 8, 15, 7, 7],)","[8, 15, 7, 7, 16, 11, 13, 11, 3, 1]",list(int) -> list(int)
+2579,keep squares,"([9, 8, 4, 16, 5, 16, 9],)","[9, 4, 16, 16, 9]",list(int) -> list(int)
+2580,has-k with k=1,"([1, 1, 1, 7],)",True,list(int) -> bool
+2581,replace-all-with-index-k with k=4,"([16, 7, 6, 13, 1, 0, 1, 15, 10, 14],)","[13, 13, 13, 13, 13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+2582,kth-largest with k=5,"([7, 2, 7, 14, 6, 0, 2, 14, 2, 16, 16],)",7,list(int) -> int
+2583,remove-index-k with k=4,"([14, 4, 7, 12, 4, 3],)","[14, 4, 7, 4, 3]",list(int) -> list(int)
+2584,remove gt 3,"([0, 2, 2, 0, 0],)","[0, 2, 2, 0, 0]",list(int) -> list(int)
+2585,bool-identify-k with k=2,"([2, 12, 11, 5, 12, 1],)","[True, False, False, False, False, False]",list(int) -> list(bool)
+2586,prepend-index-k with k=2,"([12, 11],)","[11, 12, 11]",list(int) -> list(int)
+2587,sort,"([8, 2, 10, 14],)","[2, 8, 10, 14]",list(int) -> list(int)
+2588,has-k with k=2,"([12, 4, 7, 15],)",False,list(int) -> bool
+2589,slice-k-n with k=1 and n=4,"([12, 1, 8, 14, 0, 15, 6, 16, 1],)","[12, 1, 8, 14]",list(int) -> list(int)
+2590,index-k with k=2,"([8, 10, 0, 6, 10, 8, 10, 12, 11],)",10,list(int) -> int
+2591,kth-smallest with k=2,"([10, 1, 9, 16, 8, 11, 16, 13, 1],)",1,list(int) -> int
+2592,is-mod-k with k=3,"([39, 9, 45, 9, 6],)",True,list(int) -> bool
+2593,caesar-cipher-k-modulo-n with k=1 and n=5,"([3, 3, 0, 2, 1, 0],)","[4, 4, 1, 3, 2, 1]",list(int) -> list(int)
+2594,slice-k-n with k=1 and n=1,"([16, 14, 0, 6, 8, 4, 0, 0, 11],)",[16],list(int) -> list(int)
+2595,modulo-k with k=4,"([0, 1, 13, 12, 15, 10],)","[0, 1, 1, 0, 3, 2]",list(int) -> list(int)
+2596,is-odds,"([4, 1, 12, 0, 9],)",False,list(int) -> bool
+2597,slice-k-n with k=2 and n=4,"([15, 10, 7, 11, 7, 4, 6],)","[10, 7, 11, 7]",list(int) -> list(int)
+2598,+1 maximum list,"([6, 10, 1, 9],)",11,list(int) -> int
+2599,is-squares,"([256, 64, 169, 64, 0, 196],)",True,list(int) -> bool
+2600,keep gt 1,"([0, 3, 0, 5, 2],)","[3, 5, 2]",list(int) -> list(int)
+2601,keep eq 3,"([4, 3, 3, 0, 4],)","[3, 3]",list(int) -> list(int)
+2602,bool-identify-is-mod-k with k=3,"([12],)",[True],list(int) -> list(bool)
+2603,pow-k with k=4,"([0, 9, 12, 7, 0],)","[0, 6561, 20736, 2401, 0]",list(int) -> list(int)
+2604,slice-k-n with k=2 and n=5,"([11, 15, 3, 9, 0, 16, 1, 0, 8, 15, 8],)","[15, 3, 9, 0, 16]",list(int) -> list(int)
+2605,repeat,"([4, 6],)","[6, 6, 6, 6]",list(int) -> list(int)
+2606,slice-k-n with k=4 and n=5,"([1, 6, 1, 5, 16, 14, 0, 9, 9, 13, 4, 9, 14],)","[5, 16, 14, 0, 9]",list(int) -> list(int)
+2607,bool-identify-geq-k with k=4,"([2, 15],)","[False, True]",list(int) -> list(bool)
+2608,repeat-many,"([5, 7, 0],)","[7, 0, 7, 0, 7, 0, 7, 0, 7, 0]",list(int) -> list(int)
+2609,has-k with k=3,"([3],)",True,list(int) -> bool
+2610,prepend-k with k=1,"([15, 3, 5],)","[1, 15, 3, 5]",list(int) -> list(int)
+2611,bool-identify-geq-k with k=3,"([8, 4, 1, 7],)","[True, True, False, True]",list(int) -> list(bool)
+2612,rotate-k with k=4,"([15, 8, 14, 3, 4, 16, 1, 2, 5, 10, 5, 16, 4, 8],)","[5, 16, 4, 8, 15, 8, 14, 3, 4, 16, 1, 2, 5, 10]",list(int) -> list(int)
+2613,remove-index-k with k=5,"([1, 3, 13, 12, 5, 8, 13, 0, 13, 3],)","[1, 3, 13, 12, 8, 13, 0, 13, 3]",list(int) -> list(int)
+2614,kth-largest with k=5,"([16, 7, 3, 14, 4, 9, 1, 13, 4, 8, 6],)",8,list(int) -> int
+2615,replace-all-with-index-k with k=1,"([0, 16, 6, 10],)","[0, 0, 0, 0]",list(int) -> list(int)
+2616,bool-identify-is-mod-k with k=4,"([9, 4, 5],)","[False, True, False]",list(int) -> list(bool)
+2617,has-k with k=1,"([8, 8, 7, 1, 1, 2, 3],)",True,list(int) -> bool
+2618,index-k with k=2,"([4, 14, 13, 8, 14, 14, 16],)",14,list(int) -> int
+2619,kth-largest with k=5,"([9, 15, 0, 1, 8, 6, 2, 11, 4, 11],)",8,list(int) -> int
+2620,rotate-k with k=4,"([0, 9, 15, 3, 7],)","[9, 15, 3, 7, 0]",list(int) -> list(int)
+2621,keep gt 1,"([0, 6, 1, 6, 2],)","[6, 6, 2]",list(int) -> list(int)
+2622,index-k with k=1,"([15, 16, 9, 12, 15, 0, 2, 7],)",15,list(int) -> int
+2623,slice-k-n with k=1 and n=3,"([6, 13, 3, 14, 6, 3, 8, 9, 10, 7, 9, 1],)","[6, 13, 3]",list(int) -> list(int)
+2624,add-k with k=4,"([],)",[],list(int) -> list(int)
+2625,bool-identify-k with k=4,"([6, 4, 2],)","[False, True, False]",list(int) -> list(bool)
+2626,is-odds,"([13, 3, 9, 25, 25],)",True,list(int) -> bool
+2627,slice-k-n with k=5 and n=4,"([11, 4, 5, 14, 3, 13, 3, 0, 8, 6, 11, 0, 0],)","[3, 13, 3, 0]",list(int) -> list(int)
+2628,append-index-k with k=5,"([11, 9, 16, 5, 5, 16, 11, 9],)","[11, 9, 16, 5, 5, 16, 11, 9, 5]",list(int) -> list(int)
+2629,keep-mod-k with k=3,"([14, 13, 5, 8, 8, 9, 4],)",[9],list(int) -> list(int)
+2630,odds,"([14],)",[],list(int) -> list(int)
+2631,slice-k-n with k=2 and n=5,"([9, 15, 11, 12, 12, 14, 9, 2, 0, 9, 15, 13, 7, 16],)","[15, 11, 12, 12, 14]",list(int) -> list(int)
+2632,slice-k-n with k=3 and n=4,"([9, 0, 6, 6, 12, 7, 3, 13, 8],)","[6, 6, 12, 7]",list(int) -> list(int)
+2633,sum,"([15],)",15,list(int) -> int
+2634,bool-identify-k with k=2,"([2, 2, 2, 2, 2, 2, 2],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2635,append-k with k=3,"([12, 14],)","[12, 14, 3]",list(int) -> list(int)
+2636,max,"([9],)",9,list(int) -> int
+2637,caesar-cipher-k-modulo-n with k=1 and n=4,"([],)",[],list(int) -> list(int)
+2638,sort-and-deduplicate,"([4, 3],)","[3, 4]",list(int) -> list(int)
+2639,append-index-k with k=2,"([4, 6, 10, 13],)","[4, 6, 10, 13, 6]",list(int) -> list(int)
+2640,keep eq 2,"([2, 4, 3, 3, 4],)",[2],list(int) -> list(int)
+2641,has-head-in-tail,"([3, 1, 3, 4, 2],)",True,list(int) -> bool
+2642,remove eq 2,"([2, 1, 5, 3, 4],)","[1, 5, 3, 4]",list(int) -> list(int)
+2643,has-k with k=4,"([7, 11, 13, 15, 16],)",False,list(int) -> bool
+2644,bool-identify-is-mod-k with k=3,"([],)",[],list(int) -> list(bool)
+2645,prepend-k with k=4,"([12, 10, 7, 4, 0, 15, 8],)","[4, 12, 10, 7, 4, 0, 15, 8]",list(int) -> list(int)
+2646,append-k with k=2,"([12, 7, 12],)","[12, 7, 12, 2]",list(int) -> list(int)
+2647,fibonacci,"(2,)",1,int -> int
+2648,remove eq 3,"([0, 4, 0, 1, 1],)","[0, 4, 0, 1, 1]",list(int) -> list(int)
+2649,prepend-index-k with k=5,"([15, 0, 1, 13, 8, 3, 2, 10, 5, 5],)","[8, 15, 0, 1, 13, 8, 3, 2, 10, 5, 5]",list(int) -> list(int)
+2650,last,"([15, 0, 1, 3, 16, 9, 7],)",7,list(int) -> int
+2651,mult-k with k=3,"([9, 11, 0],)","[27, 33, 0]",list(int) -> list(int)
+2652,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 0, 0, 1, 0],)","[1, 1, 1, 0, 1]",list(int) -> list(int)
+2653,prepend-k with k=1,"([2, 9, 7, 12, 6],)","[1, 2, 9, 7, 12, 6]",list(int) -> list(int)
+2654,remove-index-k with k=3,"([6, 4, 16, 5, 11, 11, 14],)","[6, 4, 5, 11, 11, 14]",list(int) -> list(int)
+2655,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 2, 0, 1, 2, 1, 1],)","[3, 3, 1, 2, 3, 2, 2]",list(int) -> list(int)
+2656,is-mod-k with k=2,"([],)",True,list(int) -> bool
+2657,prepend-index-k with k=2,"([4, 8, 15, 5, 8, 12, 7, 9, 9],)","[8, 4, 8, 15, 5, 8, 12, 7, 9, 9]",list(int) -> list(int)
+2658,has-k with k=5,"([],)",False,list(int) -> bool
+2659,bool-identify-geq-k with k=2,"([13],)",[True],list(int) -> list(bool)
+2660,caesar-cipher-k-modulo-n with k=1 and n=3,"([0, 0, 0, 2, 2],)","[1, 1, 1, 0, 0]",list(int) -> list(int)
+2661,drop-k with k=2,"([12, 5, 7, 15, 6],)","[7, 15, 6]",list(int) -> list(int)
+2662,remove-index-k with k=2,"([12, 4, 1],)","[12, 1]",list(int) -> list(int)
+2663,slice-k-n with k=4 and n=4,"([6, 2, 5, 14, 9, 7, 6, 8, 5, 6, 9, 3, 10, 3, 0],)","[14, 9, 7, 6]",list(int) -> list(int)
+2664,fibonacci,"(1,)",1,int -> int
+2665,range,"(7,)","[0, 1, 2, 3, 4, 5, 6]",int -> list(int)
+2666,slice-k-n with k=3 and n=2,"([2, 4, 10, 9, 16, 0, 6],)","[10, 9]",list(int) -> list(int)
+2667,count-k with k=4,"([6, 4, 2],)",1,list(int) -> int
+2668,kth-largest with k=5,"([7, 13, 16, 12, 4, 5],)",5,list(int) -> int
+2669,modulo-k with k=2,"([10],)",[0],list(int) -> list(int)
+2670,is-squares,"([16, 49, 100],)",True,list(int) -> bool
+2671,slice-k-n with k=1 and n=2,"([10, 3, 10, 2, 4],)","[10, 3]",list(int) -> list(int)
+2672,evens,"([],)",[],list(int) -> list(int)
+2673,kth-smallest with k=5,"([6, 2, 6, 9, 12, 3, 13, 5],)",6,list(int) -> int
+2674,replace-all-with-index-k with k=2,"([5, 10, 7],)","[10, 10, 10]",list(int) -> list(int)
+2675,is-mod-k with k=3,"([],)",True,list(int) -> bool
+2676,keep gt 2,"([0, 1, 6, 6, 0],)","[6, 6]",list(int) -> list(int)
+2677,slice-k-n with k=2 and n=3,"([16, 11, 10, 0, 7, 14],)","[11, 10, 0]",list(int) -> list(int)
+2678,rotate-k with k=1,"([12, 0, 2, 3, 8, 4, 12, 4, 15, 7, 13, 4, 4, 9, 16, 7],)","[7, 12, 0, 2, 3, 8, 4, 12, 4, 15, 7, 13, 4, 4, 9, 16]",list(int) -> list(int)
+2679,is-mod-k with k=5,"([40, 5, 15, 15, 25],)",True,list(int) -> bool
+2680,remove eq 1,"([2, 2, 4, 1, 1],)","[2, 2, 4]",list(int) -> list(int)
+2681,add-k with k=1,"([0, 2, 12, 2, 11, 0],)","[1, 3, 13, 3, 12, 1]",list(int) -> list(int)
+2682,add-k with k=2,"([7, 1, 0, 11, 0, 10],)","[9, 3, 2, 13, 2, 12]",list(int) -> list(int)
+2683,is-squares,"([25],)",True,list(int) -> bool
+2684,rotate-k with k=3,"([0, 6, 9, 4, 16, 10, 12],)","[16, 10, 12, 0, 6, 9, 4]",list(int) -> list(int)
+2685,prepend-index-k with k=4,"([16, 11, 3, 0, 8, 13],)","[0, 16, 11, 3, 0, 8, 13]",list(int) -> list(int)
+2686,remove-mod-k with k=4,"([],)",[],list(int) -> list(int)
+2687,slice-k-n with k=5 and n=1,"([7, 8, 9, 14, 16, 4, 5, 9, 9, 3, 9, 14, 10, 0],)",[16],list(int) -> list(int)
+2688,kth-smallest with k=5,"([9, 5, 0, 0, 13, 1, 16, 0, 9, 3, 1],)",1,list(int) -> int
+2689,index-k with k=4,"([2, 14, 10, 13],)",13,list(int) -> int
+2690,keep primes,"([17, 5, 2, 3, 31, 3, 1],)","[17, 5, 2, 3, 31, 3]",list(int) -> list(int)
+2691,bool-identify-is-mod-k with k=2,"([2, 9, 11, 15],)","[True, False, False, False]",list(int) -> list(bool)
+2692,append-k with k=3,"([3, 3],)","[3, 3, 3]",list(int) -> list(int)
+2693,bool-identify-k with k=4,"([2, 7, 3, 3],)","[False, False, False, False]",list(int) -> list(bool)
+2694,caesar-cipher-k-modulo-n with k=3 and n=5,"([2],)",[0],list(int) -> list(int)
+2695,has-k with k=3,"([3, 15],)",True,list(int) -> bool
+2696,append-index-k with k=4,"([14, 7, 10, 3, 1, 4],)","[14, 7, 10, 3, 1, 4, 3]",list(int) -> list(int)
+2697,kth-smallest with k=1,"([13],)",13,list(int) -> int
+2698,prepend-index-k with k=5,"([14, 7, 0, 4, 12, 2, 4, 13, 6],)","[12, 14, 7, 0, 4, 12, 2, 4, 13, 6]",list(int) -> list(int)
+2699,sort,"([0, 14],)","[0, 14]",list(int) -> list(int)
+2700,kth-largest with k=5,"([11, 11, 14, 8, 14, 2, 8, 4, 1, 9, 9, 4],)",9,list(int) -> int
+2701,pow-k with k=4,"([],)",[],list(int) -> list(int)
+2702,keep primes,"([9, 4, 6, 4, 6, 5, 13],)","[5, 13]",list(int) -> list(int)
+2703,slice-k-n with k=1 and n=3,"([12, 7, 10, 10, 1, 11, 12, 10, 0, 3, 14],)","[12, 7, 10]",list(int) -> list(int)
+2704,prepend-index-k with k=1,"([11, 5, 11, 16],)","[11, 11, 5, 11, 16]",list(int) -> list(int)
+2705,range +1 maximum list,"([6, 10, 5, 2],)","[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]",list(int) -> list(int)
+2706,odds,"([6, 10],)",[],list(int) -> list(int)
+2707,keep eq 2,"([6, 6, 6, 1, 2],)",[2],list(int) -> list(int)
+2708,bool-identify-is-mod-k with k=1,"([1, 1, 1, 1, 1, 6, 1],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2709,sort,"([16, 0],)","[0, 16]",list(int) -> list(int)
+2710,prepend-index-k with k=3,"([11, 3, 6],)","[6, 11, 3, 6]",list(int) -> list(int)
+2711,keep eq 3,"([6, 0, 5, 0, 4],)",[],list(int) -> list(int)
+2712,kth-smallest with k=1,"([6, 10, 8, 14, 2, 12],)",2,list(int) -> int
+2713,slice-k-n with k=1 and n=1,"([10, 3, 10, 11, 4, 16, 7],)",[10],list(int) -> list(int)
+2714,mult-k with k=3,"([4],)",[12],list(int) -> list(int)
+2715,count-k with k=2,"([14, 0, 2, 6],)",1,list(int) -> int
+2716,index-k with k=2,"([8, 9, 0, 3, 2, 16, 12, 4, 8],)",9,list(int) -> int
+2717,keep gt 1,"([6, 1, 1, 5, 6],)","[6, 5, 6]",list(int) -> list(int)
+2718,index-k with k=5,"([4, 3, 1, 4, 0, 6, 0, 14, 13, 12],)",0,list(int) -> int
+2719,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 1, 0, 0, 1, 0],)","[1, 0, 1, 1, 0, 1]",list(int) -> list(int)
+2720,kth-smallest with k=1,"([3, 3, 12],)",3,list(int) -> int
+2721,kth-smallest with k=5,"([8, 4, 16, 7, 10, 5, 13, 1, 6, 11],)",7,list(int) -> int
+2722,keep gt 3,"([0, 5, 2, 0, 3],)",[5],list(int) -> list(int)
+2723,slice-k-n with k=3 and n=2,"([6, 5, 13, 9, 7, 10, 14, 16, 1, 7, 16, 14, 13],)","[13, 9]",list(int) -> list(int)
+2724,repeat,"([1, 3],)",[3],list(int) -> list(int)
+2725,reverse,"([14, 12],)","[12, 14]",list(int) -> list(int)
+2726,kth-largest with k=4,"([7, 4, 8, 1],)",1,list(int) -> int
+2727,slice-k-n with k=3 and n=1,"([10, 16, 10, 8, 15, 1, 14],)",[10],list(int) -> list(int)
+2728,kth-largest with k=4,"([5, 11, 5, 6, 7, 1, 3, 9, 14, 8],)",8,list(int) -> int
+2729,keep gt 3,"([0, 3, 1, 4, 3],)",[4],list(int) -> list(int)
+2730,rotate-k with k=4,"([2, 6, 10, 10, 8, 15, 16, 15, 1, 2, 7, 5, 4, 0, 13],)","[5, 4, 0, 13, 2, 6, 10, 10, 8, 15, 16, 15, 1, 2, 7]",list(int) -> list(int)
+2731,is-primes,"([0, 2, 6, 16],)",False,list(int) -> bool
+2732,repeat-k with k=4,"([7, 9, 11, 7],)","[7, 9, 11, 7, 7, 9, 11, 7, 7, 9, 11, 7, 7, 9, 11, 7]",list(int) -> list(int)
+2733,drop-k with k=1,"([5, 16, 16, 9],)","[16, 16, 9]",list(int) -> list(int)
+2734,+1 maximum list,"([10, 9, 1],)",11,list(int) -> int
+2735,prepend-k with k=5,"([16],)","[5, 16]",list(int) -> list(int)
+2736,slice-k-n with k=4 and n=1,"([10, 3, 6, 1, 10, 12, 5],)",[1],list(int) -> list(int)
+2737,prepend-index-k with k=3,"([6, 3, 0, 5, 4, 2],)","[0, 6, 3, 0, 5, 4, 2]",list(int) -> list(int)
+2738,count-k with k=1,"([1, 16, 1],)",2,list(int) -> int
+2739,repeat-many,"([2, 12],)","[12, 12]",list(int) -> list(int)
+2740,count-k with k=2,"([2, 15],)",1,list(int) -> int
+2741,rotate-k with k=2,"([14, 12, 16, 4, 3, 7, 13, 13, 0, 6, 4, 12, 10, 10, 0, 5, 7],)","[5, 7, 14, 12, 16, 4, 3, 7, 13, 13, 0, 6, 4, 12, 10, 10, 0]",list(int) -> list(int)
+2742,slice-k-n with k=3 and n=1,"([4, 15, 6, 12, 8, 9, 8, 16, 16, 5, 4, 16],)",[6],list(int) -> list(int)
+2743,keep gt 3,"([1, 4, 2, 5, 1],)","[4, 5]",list(int) -> list(int)
+2744,caesar-cipher-k-modulo-n with k=1 and n=3,"([],)",[],list(int) -> list(int)
+2745,caesar-cipher-k-modulo-n with k=5 and n=3,"([0, 0, 0, 1, 1, 1],)","[2, 2, 2, 0, 0, 0]",list(int) -> list(int)
+2746,bool-identify-k with k=2,"([9, 16, 3, 2, 7, 2],)","[False, False, False, True, False, True]",list(int) -> list(bool)
+2747,kth-largest with k=2,"([9, 16, 7, 6, 3],)",9,list(int) -> int
+2748,bool-identify-k with k=5,"([11, 12, 7],)","[False, False, False]",list(int) -> list(bool)
+2749,rotate-k with k=1,"([13, 5, 6, 6, 3, 5, 7, 6, 5, 11],)","[11, 13, 5, 6, 6, 3, 5, 7, 6, 5]",list(int) -> list(int)
+2750,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 1, 0, 0],)","[2, 2, 1, 1]",list(int) -> list(int)
+2751,bool-identify-k with k=1,"([1, 15],)","[True, False]",list(int) -> list(bool)
+2752,pop,"([1, 1, 2, 1],)","[1, 1, 2]",list(int) -> list(int)
+2753,is-mod-k with k=5,"([2, 6, 8],)",False,list(int) -> bool
+2754,slice-k-n with k=3 and n=5,"([14, 1, 6, 4, 10, 10, 13, 9, 1, 10, 4, 3, 12, 8, 14, 13],)","[6, 4, 10, 10, 13]",list(int) -> list(int)
+2755,rotate-k with k=4,"([7, 9, 13, 6, 10, 10, 14, 4, 11, 3, 0, 3, 12, 13, 13, 16],)","[12, 13, 13, 16, 7, 9, 13, 6, 10, 10, 14, 4, 11, 3, 0, 3]",list(int) -> list(int)
+2756,keep primes,"([37, 17, 2, 13, 9, 4, 29],)","[37, 17, 2, 13, 29]",list(int) -> list(int)
+2757,bool-identify-is-mod-k with k=3,"([3, 3, 3, 5, 14],)","[True, True, True, False, False]",list(int) -> list(bool)
+2758,prepend-index-k with k=1,"([11, 5, 9, 14],)","[11, 11, 5, 9, 14]",list(int) -> list(int)
+2759,slice-k-n with k=1 and n=1,"([15, 13, 8],)",[15],list(int) -> list(int)
+2760,append-index-k with k=1,"([0, 14, 6],)","[0, 14, 6, 0]",list(int) -> list(int)
+2761,remove-index-k with k=2,"([2, 2, 13, 0, 13, 5, 2, 6, 2],)","[2, 13, 0, 13, 5, 2, 6, 2]",list(int) -> list(int)
+2762,add-k with k=2,"([9, 11, 0, 0, 5, 3, 2],)","[11, 13, 2, 2, 7, 5, 4]",list(int) -> list(int)
+2763,drop-k with k=4,"([0, 5, 2, 14, 9, 3],)","[9, 3]",list(int) -> list(int)
+2764,keep-mod-head,"([4, 2, 6, 10, 8, 12],)","[8, 12]",list(int) -> list(int)
+2765,remove eq 0,"([4, 4, 0, 2, 4],)","[4, 4, 2, 4]",list(int) -> list(int)
+2766,has-k with k=4,"([15, 14, 11, 7],)",False,list(int) -> bool
+2767,modulo-k with k=2,"([],)",[],list(int) -> list(int)
+2768,remove-mod-k with k=2,"([13, 1, 3, 2, 14],)","[13, 1, 3]",list(int) -> list(int)
+2769,slice-k-n with k=5 and n=3,"([11, 6, 1, 2, 7, 9, 11, 10, 5, 8, 2, 16, 4, 0],)","[7, 9, 11]",list(int) -> list(int)
+2770,index-k with k=4,"([10, 8, 6, 7, 15, 2, 9, 16],)",7,list(int) -> int
+2771,count-k with k=2,"([2, 12, 11, 5, 12, 1],)",1,list(int) -> int
+2772,bool-identify-geq-k with k=1,"([3, 3, 3, 3],)","[True, True, True, True]",list(int) -> list(bool)
+2773,kth-largest with k=3,"([10, 15, 13, 9, 13, 15, 7, 12, 3, 14],)",14,list(int) -> int
+2774,is-odds,"([11, 31, 17, 21, 27, 25, 15],)",True,list(int) -> bool
+2775,caesar-cipher-k-modulo-n with k=3 and n=2,"([],)",[],list(int) -> list(int)
+2776,has-k with k=1,"([15, 7, 6, 15, 7],)",False,list(int) -> bool
+2777,tail,"([2, 10, 3, 12],)","[10, 3, 12]",list(int) -> list(int)
+2778,count-k with k=0,"([],)",0,list(int) -> int
+2779,bool-identify-is-prime,"([5, 11],)","[True, True]",list(int) -> list(bool)
+2780,keep eq 0,"([5, 5, 2, 5, 1],)",[],list(int) -> list(int)
+2781,mult-k with k=4,"([0, 11, 4, 11, 1, 6, 12],)","[0, 44, 16, 44, 4, 24, 48]",list(int) -> list(int)
+2782,remove-index-k with k=5,"([5, 0, 0, 13, 1, 16, 0, 9, 3],)","[5, 0, 0, 13, 16, 0, 9, 3]",list(int) -> list(int)
+2783,append-k with k=4,"([],)",[4],list(int) -> list(int)
+2784,rotate-k with k=3,"([4, 13, 10, 0, 1, 2, 6, 4],)","[2, 6, 4, 4, 13, 10, 0, 1]",list(int) -> list(int)
+2785,keep primes,"([3, 1, 8, 7, 2, 7, 31],)","[3, 7, 2, 7, 31]",list(int) -> list(int)
+2786,prepend-index-k with k=2,"([9, 14, 6],)","[14, 9, 14, 6]",list(int) -> list(int)
+2787,kth-smallest with k=3,"([4, 6, 12],)",12,list(int) -> int
+2788,index-k with k=1,"([4, 3, 13, 1],)",4,list(int) -> int
+2789,remove empty lists,"([[False], [True, True, True], [True, False], []],)","[[False], [True, True, True], [True, False]]",list(list(bool)) -> list(list(bool))
+2790,slice-k-n with k=1 and n=2,"([11, 3, 6, 11, 12, 6],)","[11, 3]",list(int) -> list(int)
+2791,modulo-k with k=2,"([1],)",[1],list(int) -> list(int)
+2792,rotate-k with k=1,"([10, 16, 6, 14, 11, 5, 1, 4, 2, 0, 15, 14, 13, 16, 12, 8, 11],)","[11, 10, 16, 6, 14, 11, 5, 1, 4, 2, 0, 15, 14, 13, 16, 12, 8]",list(int) -> list(int)
+2793,slice-k-n with k=4 and n=3,"([0, 5, 13, 3, 15, 5, 12, 5, 4, 2, 2, 3, 16],)","[3, 15, 5]",list(int) -> list(int)
+2794,index-k with k=3,"([0, 10, 11, 7, 4],)",11,list(int) -> int
+2795,mult-k with k=5,"([7, 3, 15, 2, 12],)","[35, 15, 75, 10, 60]",list(int) -> list(int)
+2796,slice-k-n with k=1 and n=1,"([8, 6, 15, 14],)",[8],list(int) -> list(int)
+2797,prepend-k with k=5,"([2, 5, 5, 0],)","[5, 2, 5, 5, 0]",list(int) -> list(int)
+2798,take-k with k=2,"([1, 9, 12, 12, 2, 3, 5, 15],)","[1, 9]",list(int) -> list(int)
+2799,append-index-k with k=2,"([3, 15],)","[3, 15, 15]",list(int) -> list(int)
+2800,add-k with k=5,"([3, 6],)","[8, 11]",list(int) -> list(int)
+2801,tail,"([12, 4],)",[4],list(int) -> list(int)
+2802,bool-identify-geq-k with k=1,"([],)",[],list(int) -> list(bool)
+2803,kth-smallest with k=4,"([12, 3, 12, 15],)",15,list(int) -> int
+2804,remove eq 0,"([2, 5, 2, 2, 6],)","[2, 5, 2, 2, 6]",list(int) -> list(int)
+2805,count-k with k=5,"([4, 12, 3, 15, 5, 5],)",2,list(int) -> int
+2806,range +1 maximum list,"([0, 5, 7, 3, 4],)","[0, 1, 2, 3, 4, 5, 6, 7]",list(int) -> list(int)
+2807,has-head-in-tail,"([11, 11, 11],)",True,list(int) -> bool
+2808,caesar-cipher-k-modulo-n with k=3 and n=4,"([1, 1],)","[0, 0]",list(int) -> list(int)
+2809,kth-largest with k=1,"([0, 1, 2, 7, 16, 3],)",16,list(int) -> int
+2810,slice-k-n with k=4 and n=1,"([4, 14, 2, 9, 2, 14, 16],)",[9],list(int) -> list(int)
+2811,dup,"([10, 7],)","[10, 10, 7, 7]",list(int) -> list(int)
+2812,index-k with k=2,"([2, 5, 14],)",5,list(int) -> int
+2813,odds,"([3, 8],)",[3],list(int) -> list(int)
+2814,kth-largest with k=5,"([0, 8, 7, 16, 13, 3, 8, 0, 13],)",8,list(int) -> int
+2815,append-k with k=4,"([5, 10, 10, 6, 11, 0],)","[5, 10, 10, 6, 11, 0, 4]",list(int) -> list(int)
+2816,is-mod-k with k=1,"([6, 14, 7],)",True,list(int) -> bool
+2817,index-k with k=3,"([13, 0, 3, 2, 9, 14, 4, 12],)",3,list(int) -> int
+2818,remove-index-k with k=5,"([16, 16, 6, 6, 11, 5, 9, 14],)","[16, 16, 6, 6, 5, 9, 14]",list(int) -> list(int)
+2819,bool-identify-is-mod-k with k=2,"([2, 8, 0, 14, 3, 10],)","[True, True, True, True, False, True]",list(int) -> list(bool)
+2820,prepend-k with k=5,"([12],)","[5, 12]",list(int) -> list(int)
+2821,pow-k with k=5,"([],)",[],list(int) -> list(int)
+2822,is-mod-k with k=1,"([0, 6, 4, 12, 15],)",True,list(int) -> bool
+2823,pow-k with k=4,"([14, 14, 16],)","[38416, 38416, 65536]",list(int) -> list(int)
+2824,is-evens,"([3, 6, 4],)",False,list(int) -> bool
+2825,bool-identify-is-mod-k with k=4,"([1],)",[False],list(int) -> list(bool)
+2826,remove-mod-k with k=4,"([10],)",[10],list(int) -> list(int)
+2827,caesar-cipher-k-modulo-n with k=2 and n=4,"([0],)",[2],list(int) -> list(int)
+2828,has-k with k=3,"([8, 7],)",False,list(int) -> bool
+2829,repeat-k with k=5,"([14, 13, 13, 4, 9],)","[14, 13, 13, 4, 9, 14, 13, 13, 4, 9, 14, 13, 13, 4, 9, 14, 13, 13, 4, 9, 14, 13, 13, 4, 9]",list(int) -> list(int)
+2830,reverse,"([9, 10, 5, 8, 3],)","[3, 8, 5, 10, 9]",list(int) -> list(int)
+2831,append-index-k with k=4,"([2, 3, 13, 14, 11, 14, 14, 0, 5],)","[2, 3, 13, 14, 11, 14, 14, 0, 5, 14]",list(int) -> list(int)
+2832,bool-identify-is-mod-k with k=5,"([9, 14, 5],)","[False, False, True]",list(int) -> list(bool)
+2833,rotate-k with k=5,"([4, 6, 9, 11, 0, 1, 11, 7, 8, 4, 3, 7],)","[7, 8, 4, 3, 7, 4, 6, 9, 11, 0, 1, 11]",list(int) -> list(int)
+2834,kth-smallest with k=5,"([10, 3, 8, 6, 6, 11, 3, 4, 1, 4, 8],)",4,list(int) -> int
+2835,remove gt 0,"([0, 5, 1, 4, 3],)",[0],list(int) -> list(int)
+2836,pow-k with k=3,"([1, 16, 6, 4, 6, 12],)","[1, 4096, 216, 64, 216, 1728]",list(int) -> list(int)
+2837,remove-mod-k with k=5,"([8, 5, 9, 25, 6],)","[8, 9, 6]",list(int) -> list(int)
+2838,pow-k with k=2,"([15],)",[225],list(int) -> list(int)
+2839,has-k with k=2,"([2, 2, 2, 2, 2, 2],)",True,list(int) -> bool
+2840,append-index-k with k=2,"([15, 0, 11, 14],)","[15, 0, 11, 14, 0]",list(int) -> list(int)
+2841,kth-largest with k=3,"([9, 15, 11, 10, 4, 13],)",11,list(int) -> int
+2842,bool-identify-is-mod-k with k=2,"([],)",[],list(int) -> list(bool)
+2843,keep-mod-k with k=5,"([13, 2],)",[],list(int) -> list(int)
+2844,caesar-cipher-k-modulo-n with k=4 and n=5,"([3, 3, 0, 2, 1, 0],)","[2, 2, 4, 1, 0, 4]",list(int) -> list(int)
+2845,kth-largest with k=1,"([13, 2],)",13,list(int) -> int
+2846,slice-k-n with k=5 and n=4,"([0, 8, 1, 11, 12, 14, 12, 5, 7, 4, 10, 13, 6, 4],)","[12, 14, 12, 5]",list(int) -> list(int)
+2847,prepend-index-k with k=4,"([3, 0, 1, 16, 1, 11, 0, 5, 9],)","[16, 3, 0, 1, 16, 1, 11, 0, 5, 9]",list(int) -> list(int)
+2848,range,"(5,)","[0, 1, 2, 3, 4]",int -> list(int)
+2849,append-index-k with k=2,"([6, 2, 7, 12, 8, 14, 16, 4, 12],)","[6, 2, 7, 12, 8, 14, 16, 4, 12, 2]",list(int) -> list(int)
+2850,remove eq 3,"([2, 3, 6, 5, 0],)","[2, 6, 5, 0]",list(int) -> list(int)
+2851,take-k with k=3,"([7, 7, 15, 15],)","[7, 7, 15]",list(int) -> list(int)
+2852,slice-k-n with k=1 and n=5,"([1, 15, 4, 2, 11, 12, 11, 9, 16, 11, 16, 12, 2, 1],)","[1, 15, 4, 2, 11]",list(int) -> list(int)
+2853,slice-k-n with k=3 and n=4,"([16, 4, 13, 12, 3, 14, 12, 16],)","[13, 12, 3, 14]",list(int) -> list(int)
+2854,prepend-k with k=0,"([6, 8, 0, 11],)","[0, 6, 8, 0, 11]",list(int) -> list(int)
+2855,take-k with k=3,"([8, 15, 6, 6, 1, 5],)","[8, 15, 6]",list(int) -> list(int)
+2856,pow-k with k=4,"([],)",[],list(int) -> list(int)
+2857,rotate-k with k=5,"([4, 12, 6, 13, 11, 6, 1, 3, 4],)","[11, 6, 1, 3, 4, 4, 12, 6, 13]",list(int) -> list(int)
+2858,slice-k-n with k=1 and n=2,"([9, 5, 1, 6, 8, 13, 16],)","[9, 5]",list(int) -> list(int)
+2859,replace-all-with-index-k with k=2,"([10, 8, 6, 6, 6, 14, 6],)","[8, 8, 8, 8, 8, 8, 8]",list(int) -> list(int)
+2860,keep eq 0,"([5, 0, 5, 6, 4],)",[0],list(int) -> list(int)
+2861,rotate-k with k=2,"([7, 11, 0, 13, 3, 9, 1, 13, 10, 8, 2, 12, 9, 11],)","[9, 11, 7, 11, 0, 13, 3, 9, 1, 13, 10, 8, 2, 12]",list(int) -> list(int)
+2862,drop-k with k=3,"([16, 3, 9, 1, 7, 12, 5, 12, 4, 14],)","[1, 7, 12, 5, 12, 4, 14]",list(int) -> list(int)
+2863,append-index-k with k=3,"([6, 8, 2, 6, 7, 14, 9],)","[6, 8, 2, 6, 7, 14, 9, 2]",list(int) -> list(int)
+2864,kth-largest with k=2,"([0, 9, 1],)",1,list(int) -> int
+2865,remove-index-k with k=5,"([6, 11, 10, 7, 11],)","[6, 11, 10, 7]",list(int) -> list(int)
+2866,has-k with k=4,"([4, 4, 13],)",True,list(int) -> bool
+2867,slice-k-n with k=3 and n=2,"([10, 10, 15, 3, 3, 9, 6, 15],)","[15, 3]",list(int) -> list(int)
+2868,remove-index-k with k=2,"([7, 4, 0, 1, 11, 0, 11],)","[7, 0, 1, 11, 0, 11]",list(int) -> list(int)
+2869,keep-mod-k with k=2,"([1, 10, 11],)",[10],list(int) -> list(int)
+2870,bool-identify-is-mod-k with k=4,"([4, 12, 3, 15, 5, 5],)","[True, True, False, False, False, False]",list(int) -> list(bool)
+2871,has-head-in-tail,"([2, 15, 2, 2, 2, 2],)",True,list(int) -> bool
+2872,prepend-k with k=1,"([8, 12, 11, 7, 12],)","[1, 8, 12, 11, 7, 12]",list(int) -> list(int)
+2873,remove-mod-k with k=2,"([15, 7, 15, 10, 13, 3, 12],)","[15, 7, 15, 13, 3]",list(int) -> list(int)
+2874,sort,"([2, 5, 4, 2, 0, 5, 1, 1],)","[0, 1, 1, 2, 2, 4, 5, 5]",list(int) -> list(int)
+2875,modulo-k with k=5,"([0, 10],)","[0, 0]",list(int) -> list(int)
+2876,pow-k with k=3,"([1],)",[1],list(int) -> list(int)
+2877,add-k with k=3,"([12, 11, 1, 7, 8, 4, 5],)","[15, 14, 4, 10, 11, 7, 8]",list(int) -> list(int)
+2878,mult-k with k=2,"([11, 2, 7, 10, 4],)","[22, 4, 14, 20, 8]",list(int) -> list(int)
+2879,bool-identify-geq-k with k=4,"([],)",[],list(int) -> list(bool)
+2880,slice-k-n with k=1 and n=3,"([12, 4, 14, 2, 6, 9, 14],)","[12, 4, 14]",list(int) -> list(int)
+2881,drop-k with k=3,"([14, 0, 7, 11, 10, 0, 5, 2],)","[11, 10, 0, 5, 2]",list(int) -> list(int)
+2882,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 0, 1, 1, 1],)","[0, 1, 0, 0, 0]",list(int) -> list(int)
+2883,caesar-cipher-k-modulo-n with k=5 and n=3,"([1, 2, 1, 2],)","[0, 1, 0, 1]",list(int) -> list(int)
+2884,remove gt 2,"([2, 2, 2, 6, 5],)","[2, 2, 2]",list(int) -> list(int)
+2885,drop-k with k=5,"([2, 9, 16, 2, 7, 12],)",[12],list(int) -> list(int)
+2886,add-k with k=5,"([3, 14, 15, 0, 12, 0],)","[8, 19, 20, 5, 17, 5]",list(int) -> list(int)
+2887,kth-largest with k=4,"([16, 9, 15, 4, 16],)",9,list(int) -> int
+2888,caesar-cipher-k-modulo-n with k=3 and n=4,"([],)",[],list(int) -> list(int)
+2889,has-k with k=3,"([3, 2, 3, 3],)",True,list(int) -> bool
+2890,slice-k-n with k=4 and n=2,"([8, 14, 15, 4, 16, 7, 14, 14, 2, 10, 1, 1, 1],)","[4, 16]",list(int) -> list(int)
+2891,index-k with k=4,"([12, 9, 0, 0, 5],)",0,list(int) -> int
+2892,index-k with k=1,"([5, 15, 8, 10, 13, 12, 7, 0],)",5,list(int) -> int
+2893,repeat-many,"([1, 7, 16, 2, 2],)","[7, 16, 2, 2]",list(int) -> list(int)
+2894,remove-index-k with k=3,"([4, 8, 10, 3, 2, 12, 9, 0, 0],)","[4, 8, 3, 2, 12, 9, 0, 0]",list(int) -> list(int)
+2895,keep eq 1,"([1, 3, 1, 6, 1],)","[1, 1, 1]",list(int) -> list(int)
+2896,keep squares,"([1, 2, 0, 16, 0, 9, 0],)","[1, 0, 16, 0, 9, 0]",list(int) -> list(int)
+2897,has-head-in-tail,"([7, 7, 7],)",True,list(int) -> bool
+2898,modulo-k with k=1,"([1, 4, 12],)","[0, 0, 0]",list(int) -> list(int)
+2899,append-k with k=5,"([6, 16, 1, 5, 11, 8, 5],)","[6, 16, 1, 5, 11, 8, 5, 5]",list(int) -> list(int)
+2900,remove gt 1,"([2, 6, 2, 5, 0],)",[0],list(int) -> list(int)
+2901,mult-k with k=5,"([12, 7, 3, 10, 14],)","[60, 35, 15, 50, 70]",list(int) -> list(int)
+2902,slice-k-n with k=2 and n=3,"([4, 11, 16, 11, 10, 9, 5, 12, 6, 0, 5],)","[11, 16, 11]",list(int) -> list(int)
+2903,keep-mod-k with k=2,"([0, 15, 9, 13, 13, 15, 3],)",[0],list(int) -> list(int)
+2904,index-k with k=1,"([10, 4, 16, 1],)",10,list(int) -> int
+2905,has-head-in-tail,"([5, 14, 14, 1, 7, 9, 4],)",False,list(int) -> bool
+2906,prepend-index-k with k=1,"([4, 1],)","[4, 4, 1]",list(int) -> list(int)
+2907,remove-index-k with k=3,"([14, 10, 5, 2, 16],)","[14, 10, 2, 16]",list(int) -> list(int)
+2908,caesar-cipher-k-modulo-n with k=3 and n=5,"([3, 0, 3, 4, 3, 3],)","[1, 3, 1, 2, 1, 1]",list(int) -> list(int)
+2909,slice-k-n with k=1 and n=2,"([4, 10, 5, 4, 8, 8, 1, 7, 10, 15, 8],)","[4, 10]",list(int) -> list(int)
+2910,caesar-cipher-k-modulo-n with k=2 and n=4,"([],)",[],list(int) -> list(int)
+2911,remove-mod-k with k=4,"([3, 32, 32, 36],)",[3],list(int) -> list(int)
+2912,bool-identify-is-mod-k with k=3,"([11, 0, 1],)","[False, True, False]",list(int) -> list(bool)
+2913,mult-k with k=5,"([],)",[],list(int) -> list(int)
+2914,+1 maximum list,"([3, 5, 2, 3],)",6,list(int) -> int
+2915,bool-identify-k with k=4,"([4, 16, 10],)","[True, False, False]",list(int) -> list(bool)
+2916,add-k with k=5,"([4, 5, 4, 0, 8, 9],)","[9, 10, 9, 5, 13, 14]",list(int) -> list(int)
+2917,bool-identify-geq-k with k=5,"([8, 6, 12, 16, 3, 6, 16],)","[True, True, True, True, False, True, True]",list(int) -> list(bool)
+2918,modulo-k with k=3,"([6, 8, 1, 3],)","[0, 2, 1, 0]",list(int) -> list(int)
+2919,index-k with k=4,"([14, 9, 7, 11],)",11,list(int) -> int
+2920,drop-k with k=2,"([15, 16, 10, 8, 15, 9, 15],)","[10, 8, 15, 9, 15]",list(int) -> list(int)
+2921,index-k with k=4,"([2, 16, 6, 4, 4, 1, 5, 1, 10],)",4,list(int) -> int
+2922,is-squares,"([4, 15, 1],)",False,list(int) -> bool
+2923,has-k with k=4,"([4, 4, 4, 4, 4],)",True,list(int) -> bool
+2924,pow-k with k=2,"([14, 14, 14, 0, 7, 3],)","[196, 196, 196, 0, 49, 9]",list(int) -> list(int)
+2925,prepend-k with k=5,"([4, 10, 11, 11, 16, 7, 14],)","[5, 4, 10, 11, 11, 16, 7, 14]",list(int) -> list(int)
+2926,add-k with k=5,"([5],)",[10],list(int) -> list(int)
+2927,remove-index-k with k=5,"([3, 8, 6, 6, 11, 3, 4, 1, 4],)","[3, 8, 6, 6, 3, 4, 1, 4]",list(int) -> list(int)
+2928,caesar-cipher-k-modulo-n with k=1 and n=5,"([4, 2, 2],)","[0, 3, 3]",list(int) -> list(int)
+2929,keep gt 2,"([4, 1, 2, 6, 6],)","[4, 6, 6]",list(int) -> list(int)
+2930,replace-all-with-index-k with k=4,"([0, 10, 8, 9, 8, 1, 9, 3],)","[9, 9, 9, 9, 9, 9, 9, 9]",list(int) -> list(int)
+2931,has-k with k=3,"([],)",False,list(int) -> bool
+2932,bool-identify-k with k=5,"([5, 0],)","[True, False]",list(int) -> list(bool)
+2933,replace-all-with-index-k with k=5,"([4, 16, 8, 9, 13, 8, 12, 11, 4, 5, 2],)","[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+2934,evens,"([15],)",[],list(int) -> list(int)
+2935,mult-k with k=2,"([4, 1, 5, 8],)","[8, 2, 10, 16]",list(int) -> list(int)
+2936,bool-identify-is-mod-k with k=1,"([0, 7, 0, 8, 1, 15, 10],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+2937,take-k with k=3,"([10, 7, 14],)","[10, 7, 14]",list(int) -> list(int)
+2938,mult-k with k=4,"([9],)",[36],list(int) -> list(int)
+2939,is-squares,"([169, 25, 25, 64, 49, 16, 256],)",True,list(int) -> bool
+2940,is-mod-k with k=5,"([],)",True,list(int) -> bool
+2941,tail,"([6, 8, 2, 7, 6, 9, 8],)","[8, 2, 7, 6, 9, 8]",list(int) -> list(int)
+2942,drop-k with k=4,"([1, 13, 0, 6, 13],)",[13],list(int) -> list(int)
+2943,remove-index-k with k=5,"([9, 11, 7, 13, 15, 10, 10, 8],)","[9, 11, 7, 13, 10, 10, 8]",list(int) -> list(int)
+2944,remove empty lists,"([[True, True], [True, True], [], [True]],)","[[True, True], [True, True], [True]]",list(list(bool)) -> list(list(bool))
+2945,rotate-k with k=5,"([3, 12, 13, 12, 5, 7, 7, 2],)","[12, 5, 7, 7, 2, 3, 12, 13]",list(int) -> list(int)
+2946,kth-smallest with k=2,"([10, 5],)",10,list(int) -> int
+2947,remove-mod-k with k=2,"([15, 2, 6],)",[15],list(int) -> list(int)
+2948,keep gt 3,"([5, 0, 6, 1, 4],)","[5, 6, 4]",list(int) -> list(int)
+2949,caesar-cipher-k-modulo-n with k=2 and n=5,"([2, 3, 3],)","[4, 0, 0]",list(int) -> list(int)
+2950,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 0, 0, 2, 0, 1],)","[2, 1, 1, 0, 1, 2]",list(int) -> list(int)
+2951,slice-k-n with k=5 and n=2,"([9, 7, 1, 9, 14, 0, 9, 4, 14, 16, 8, 0, 4],)","[14, 0]",list(int) -> list(int)
+2952,pow-k with k=4,"([12, 15],)","[20736, 50625]",list(int) -> list(int)
+2953,slice-k-n with k=1 and n=2,"([8, 6, 10, 14, 3],)","[8, 6]",list(int) -> list(int)
+2954,caesar-cipher-k-modulo-n with k=5 and n=4,"([0, 0, 0, 0, 2, 2],)","[1, 1, 1, 1, 3, 3]",list(int) -> list(int)
+2955,keep gt 3,"([1, 0, 6, 1, 6],)","[6, 6]",list(int) -> list(int)
+2956,kth-smallest with k=3,"([4, 14, 15],)",15,list(int) -> int
+2957,is-mod-k with k=4,"([7, 4, 11],)",False,list(int) -> bool
+2958,fibonacci,"(6,)",8,int -> int
+2959,remove eq 1,"([2, 0, 0, 6, 2],)","[2, 0, 0, 6, 2]",list(int) -> list(int)
+2960,index-k with k=1,"([12, 12],)",12,list(int) -> int
+2961,slice-k-n with k=1 and n=4,"([2, 13, 1, 16, 9, 5, 16, 16, 4, 1, 8],)","[2, 13, 1, 16]",list(int) -> list(int)
+2962,bool-identify-geq-k with k=0,"([0, 0, 0],)","[True, True, True]",list(int) -> list(bool)
+2963,remove empty lists,"([[False, False], [True], [True, False, True], [False, False]],)","[[False, False], [True], [True, False, True], [False, False]]",list(list(bool)) -> list(list(bool))
+2964,append-k with k=3,"([1],)","[1, 3]",list(int) -> list(int)
+2965,caesar-cipher-k-modulo-n with k=2 and n=5,"([],)",[],list(int) -> list(int)
+2966,slice-k-n with k=4 and n=4,"([12, 0, 1, 11, 12, 9, 15, 10, 1, 5, 11, 16, 9],)","[11, 12, 9, 15]",list(int) -> list(int)
+2967,keep-mod-k with k=5,"([8, 13, 8, 0, 14, 0],)","[0, 0]",list(int) -> list(int)
+2968,count-head-in-tail,"([14, 14],)",1,list(int) -> int
+2969,slice-k-n with k=5 and n=2,"([5, 12, 16, 6, 2, 14, 9, 15, 6],)","[2, 14]",list(int) -> list(int)
+2970,range,"(3,)","[0, 1, 2]",int -> list(int)
+2971,remove-index-k with k=4,"([13, 12, 15, 1, 7, 3, 16, 10, 12, 14],)","[13, 12, 15, 7, 3, 16, 10, 12, 14]",list(int) -> list(int)
+2972,bool-identify-k with k=3,"([3, 3, 3, 4],)","[True, True, True, False]",list(int) -> list(bool)
+2973,prepend-k with k=2,"([6, 6, 8, 3, 12],)","[2, 6, 6, 8, 3, 12]",list(int) -> list(int)
+2974,bool-identify-k with k=0,"([9, 7, 2, 6],)","[False, False, False, False]",list(int) -> list(bool)
+2975,kth-smallest with k=3,"([1, 7, 3],)",7,list(int) -> int
+2976,sum,"([0],)",0,list(int) -> int
+2977,count-k with k=4,"([4, 4, 14, 4, 16],)",3,list(int) -> int
+2978,keep gt 2,"([5, 5, 6, 4, 0],)","[5, 5, 6, 4]",list(int) -> list(int)
+2979,is-mod-k with k=4,"([10, 15, 6, 9, 16, 12],)",False,list(int) -> bool
+2980,pow-k with k=4,"([1, 7, 11, 13],)","[1, 2401, 14641, 28561]",list(int) -> list(int)
+2981,replace-all-with-index-k with k=3,"([15, 14, 8, 5],)","[8, 8, 8, 8]",list(int) -> list(int)
+2982,remove eq 0,"([6, 0, 1, 6, 3],)","[6, 1, 6, 3]",list(int) -> list(int)
+2983,prepend-k with k=3,"([9, 14, 2, 5, 12, 10, 3],)","[3, 9, 14, 2, 5, 12, 10, 3]",list(int) -> list(int)
+2984,reverse,"([11, 5, 5, 6],)","[6, 5, 5, 11]",list(int) -> list(int)
+2985,has-k with k=5,"([5, 5, 5, 5, 5, 5],)",True,list(int) -> bool
+2986,slice-k-n with k=5 and n=5,"([12, 0, 10, 14, 10, 8, 12, 8, 7, 16, 0, 8, 5, 3, 10],)","[10, 8, 12, 8, 7]",list(int) -> list(int)
+2987,tail,"([11, 12, 14, 1, 2, 15, 9],)","[12, 14, 1, 2, 15, 9]",list(int) -> list(int)
+2988,count-k with k=3,"([11, 0, 3, 3, 3, 3, 3],)",5,list(int) -> int
+2989,take-k with k=5,"([7, 12, 9, 13, 16, 6, 1, 9, 10, 14, 9],)","[7, 12, 9, 13, 16]",list(int) -> list(int)
+2990,take-k with k=3,"([7, 3, 11, 12, 6, 7, 13, 9, 9],)","[7, 3, 11]",list(int) -> list(int)
+2991,keep-mod-k with k=5,"([20],)",[20],list(int) -> list(int)
+2992,bool-identify-is-prime,"([2],)",[True],list(int) -> list(bool)
+2993,replace-all-with-index-k with k=3,"([7, 10, 4, 1, 12],)","[4, 4, 4, 4, 4]",list(int) -> list(int)
+2994,pow-k with k=3,"([7, 10, 9, 7, 8, 8],)","[343, 1000, 729, 343, 512, 512]",list(int) -> list(int)
+2995,replace-all-with-index-k with k=5,"([12, 13, 9, 8, 3, 4, 5],)","[3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+2996,keep-mod-k with k=4,"([24, 8, 28, 36, 11, 12],)","[24, 8, 28, 36, 12]",list(int) -> list(int)
+2997,is-mod-k with k=3,"([0, 16, 0, 3],)",False,list(int) -> bool
+2998,repeat,"([7, 6],)","[6, 6, 6, 6, 6, 6, 6]",list(int) -> list(int)
+2999,keep-mod-k with k=3,"([18, 0],)","[18, 0]",list(int) -> list(int)
+3000,kth-smallest with k=4,"([13, 12, 15, 1, 7, 3, 16, 10, 12, 14],)",10,list(int) -> int
+3001,prepend-index-k with k=2,"([0, 13, 3, 1, 12, 6, 11, 9],)","[13, 0, 13, 3, 1, 12, 6, 11, 9]",list(int) -> list(int)
+3002,keep eq 3,"([6, 6, 5, 3, 2],)",[3],list(int) -> list(int)
+3003,append-k with k=2,"([12, 12, 9, 6, 8, 2],)","[12, 12, 9, 6, 8, 2, 2]",list(int) -> list(int)
+3004,is-mod-k with k=5,"([65, 60],)",True,list(int) -> bool
+3005,index-k with k=3,"([3, 11, 3],)",3,list(int) -> int
+3006,has-k with k=1,"([16],)",False,list(int) -> bool
+3007,add-k with k=3,"([8, 8],)","[11, 11]",list(int) -> list(int)
+3008,sort-and-deduplicate,"([0, 2, 7],)","[0, 2, 7]",list(int) -> list(int)
+3009,modulo-k with k=3,"([1, 7, 11, 13],)","[1, 1, 2, 1]",list(int) -> list(int)
+3010,caesar-cipher-k-modulo-n with k=5 and n=3,"([1, 0, 1, 1],)","[0, 2, 0, 0]",list(int) -> list(int)
+3011,slice-k-n with k=4 and n=5,"([2, 8, 6, 13, 2, 0, 0, 8, 8, 7, 8, 15, 12, 12, 13],)","[13, 2, 0, 0, 8]",list(int) -> list(int)
+3012,bool-identify-geq-k with k=4,"([],)",[],list(int) -> list(bool)
+3013,fibonacci,"(6,)",8,int -> int
+3014,keep-mod-head,"([3, 1, 3, 4, 7, 6, 9, 2],)","[3, 6, 9]",list(int) -> list(int)
+3015,slice-k-n with k=3 and n=1,"([3, 6, 16, 2, 7, 8, 16],)",[16],list(int) -> list(int)
+3016,kth-largest with k=1,"([5, 16, 16, 9],)",16,list(int) -> int
+3017,count-k with k=3,"([],)",0,list(int) -> int
+3018,caesar-cipher-k-modulo-n with k=3 and n=4,"([1, 3, 2, 3, 2],)","[0, 2, 1, 2, 1]",list(int) -> list(int)
+3019,take-k with k=1,"([2, 10, 15, 3, 11],)",[2],list(int) -> list(int)
+3020,bool-identify-k with k=1,"([],)",[],list(int) -> list(bool)
+3021,remove-mod-k with k=3,"([13, 9, 6, 15, 14, 11, 13],)","[13, 14, 11, 13]",list(int) -> list(int)
+3022,replace-all-with-index-k with k=5,"([4, 10, 1, 16, 2, 11, 10, 12, 4, 10, 8, 6],)","[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]",list(int) -> list(int)
+3023,keep squares,"([5, 9, 16, 5, 5, 4, 0],)","[9, 16, 4, 0]",list(int) -> list(int)
+3024,slice-k-n with k=2 and n=3,"([1, 5, 3, 6, 16, 9],)","[5, 3, 6]",list(int) -> list(int)
+3025,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 0, 1, 1, 0],)","[1, 1, 0, 0, 1]",list(int) -> list(int)
+3026,caesar-cipher-k-modulo-n with k=5 and n=3,"([2, 1, 1, 0, 0, 2, 2],)","[1, 0, 0, 2, 2, 1, 1]",list(int) -> list(int)
+3027,count-k with k=5,"([1, 6],)",0,list(int) -> int
+3028,slice-k-n with k=3 and n=3,"([4, 6, 3, 11, 8, 0, 13, 2, 12, 10, 12, 12, 15],)","[3, 11, 8]",list(int) -> list(int)
+3029,is-primes,"([71, 13],)",True,list(int) -> bool
+3030,has-k with k=2,"([11, 9, 16, 9, 7, 2, 6],)",True,list(int) -> bool
+3031,keep eq 3,"([4, 5, 3, 6, 0],)",[3],list(int) -> list(int)
+3032,keep eq 3,"([3, 2, 3, 6, 2],)","[3, 3]",list(int) -> list(int)
+3033,bool-identify-geq-k with k=4,"([],)",[],list(int) -> list(bool)
+3034,bool-identify-k with k=0,"([16, 12, 15],)","[False, False, False]",list(int) -> list(bool)
+3035,count-k with k=2,"([0, 8, 7, 2, 5, 2],)",2,list(int) -> int
+3036,bool-identify-geq-k with k=2,"([14, 2, 10, 5, 6],)","[True, True, True, True, True]",list(int) -> list(bool)
+3037,modulo-k with k=2,"([0, 2, 5, 4, 11, 7],)","[0, 0, 1, 0, 1, 1]",list(int) -> list(int)
+3038,bool-identify-is-prime,"([2, 0],)","[True, False]",list(int) -> list(bool)
+3039,remove-index-k with k=2,"([12, 14, 13, 2],)","[12, 13, 2]",list(int) -> list(int)
+3040,is-evens,"([12, 16, 22, 22, 4, 2, 6],)",True,list(int) -> bool
+3041,remove-mod-k with k=2,"([5, 3, 1, 13, 7, 7, 4],)","[5, 3, 1, 13, 7, 7]",list(int) -> list(int)
+3042,prepend-index-k with k=4,"([4, 8, 5, 3, 1, 7, 5, 6, 13],)","[3, 4, 8, 5, 3, 1, 7, 5, 6, 13]",list(int) -> list(int)
+3043,slice-k-n with k=2 and n=3,"([16, 8, 13, 3, 9, 1, 16, 9, 3, 4],)","[8, 13, 3]",list(int) -> list(int)
+3044,is-mod-k with k=4,"([52, 0, 8],)",True,list(int) -> bool
+3045,repeat-many,"([2, 15, 1],)","[15, 1, 15, 1]",list(int) -> list(int)
+3046,prepend-k with k=0,"([5, 11, 9, 0, 7, 1, 7],)","[0, 5, 11, 9, 0, 7, 1, 7]",list(int) -> list(int)
+3047,caesar-cipher-k-modulo-n with k=1 and n=3,"([1, 2, 1],)","[2, 0, 2]",list(int) -> list(int)
+3048,bool-identify-is-mod-k with k=4,"([4, 0],)","[True, True]",list(int) -> list(bool)
+3049,dup,"([8, 0, 9, 15, 7, 14, 9],)","[8, 8, 0, 0, 9, 9, 15, 15, 7, 7, 14, 14, 9, 9]",list(int) -> list(int)
+3050,kth-largest with k=3,"([9, 0, 5, 8, 5, 8, 13],)",8,list(int) -> int
+3051,remove gt 1,"([0, 0, 4, 5, 1],)","[0, 0, 1]",list(int) -> list(int)
+3052,kth-largest with k=1,"([4, 7, 11, 4, 2, 5, 13, 5],)",13,list(int) -> int
+3053,bool-identify-is-mod-k with k=2,"([2, 2, 2, 4],)","[True, True, True, True]",list(int) -> list(bool)
+3054,pow-k with k=3,"([5, 16, 10, 16, 8, 7],)","[125, 4096, 1000, 4096, 512, 343]",list(int) -> list(int)
+3055,caesar-cipher-k-modulo-n with k=5 and n=4,"([3, 3],)","[0, 0]",list(int) -> list(int)
+3056,bool-identify-is-prime,"([16, 12, 15, 7],)","[False, False, False, True]",list(int) -> list(bool)
+3057,keep-mod-k with k=3,"([6, 10, 2, 7, 12],)","[6, 12]",list(int) -> list(int)
+3058,replace-all-with-index-k with k=1,"([16, 15, 10, 14, 4, 15, 10, 14],)","[16, 16, 16, 16, 16, 16, 16, 16]",list(int) -> list(int)
+3059,kth-smallest with k=4,"([1, 5, 15, 15, 2, 10, 13, 15, 3],)",5,list(int) -> int
+3060,kth-largest with k=5,"([13, 11, 10, 7, 13, 11, 9],)",10,list(int) -> int
+3061,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 1, 0, 1, 0, 1],)","[1, 0, 1, 0, 1, 0]",list(int) -> list(int)
+3062,is-primes,"([13, 9, 13, 0, 3, 10, 12],)",False,list(int) -> bool
+3063,caesar-cipher-k-modulo-n with k=5 and n=3,"([2],)",[1],list(int) -> list(int)
+3064,len,"([1, 1, 2, 1],)",4,list(int) -> int
+3065,has-k with k=0,"([],)",False,list(int) -> bool
+3066,take-k with k=1,"([2, 0, 7],)",[2],list(int) -> list(int)
+3067,slice-k-n with k=4 and n=1,"([0, 6, 2, 7, 9, 8, 11, 4, 9, 11, 2],)",[7],list(int) -> list(int)
+3068,prepend-k with k=1,"([6],)","[1, 6]",list(int) -> list(int)
+3069,bool-identify-k with k=2,"([13, 10, 9],)","[False, False, False]",list(int) -> list(bool)
+3070,kth-largest with k=1,"([2, 15, 14, 6, 4, 5, 5],)",15,list(int) -> int
+3071,bool-identify-geq-k with k=4,"([12, 6, 15, 6, 14, 8, 6],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+3072,dup,"([16, 15, 13],)","[16, 16, 15, 15, 13, 13]",list(int) -> list(int)
+3073,mult-k with k=0,"([],)",[],list(int) -> list(int)
+3074,append-k with k=2,"([7, 1, 3, 1, 4, 15],)","[7, 1, 3, 1, 4, 15, 2]",list(int) -> list(int)
+3075,repeat-k with k=5,"([1, 6],)","[1, 6, 1, 6, 1, 6, 1, 6, 1, 6]",list(int) -> list(int)
+3076,pow-k with k=4,"([],)",[],list(int) -> list(int)
+3077,is-odds,"([27, 29, 15, 21, 19],)",True,list(int) -> bool
+3078,keep-mod-head,"([2],)",[],list(int) -> list(int)
+3079,sort,"([12, 2, 8, 5, 15],)","[2, 5, 8, 12, 15]",list(int) -> list(int)
+3080,remove gt 0,"([1, 1, 1, 1, 6],)",[],list(int) -> list(int)
+3081,append-index-k with k=1,"([0, 1, 7],)","[0, 1, 7, 0]",list(int) -> list(int)
+3082,has-k with k=1,"([1, 1, 1],)",True,list(int) -> bool
+3083,bool-identify-k with k=3,"([12, 3, 14],)","[False, True, False]",list(int) -> list(bool)
+3084,remove eq 2,"([5, 1, 3, 5, 4],)","[5, 1, 3, 5, 4]",list(int) -> list(int)
+3085,bool-identify-geq-k with k=2,"([8, 5, 9, 13, 1, 13],)","[True, True, True, True, False, True]",list(int) -> list(bool)
+3086,bool-identify-is-mod-k with k=5,"([8, 7, 5, 10],)","[False, False, True, True]",list(int) -> list(bool)
+3087,remove-index-k with k=1,"([10],)",[],list(int) -> list(int)
+3088,pop,"([1, 7, 11, 13, 10],)","[1, 7, 11, 13]",list(int) -> list(int)
+3089,caesar-cipher-k-modulo-n with k=3 and n=2,"([0, 1, 1, 0, 1, 1],)","[1, 0, 0, 1, 0, 0]",list(int) -> list(int)
+3090,has-k with k=1,"([2, 4, 6, 9],)",False,list(int) -> bool
+3091,modulo-k with k=4,"([16, 12],)","[0, 0]",list(int) -> list(int)
+3092,slice-k-n with k=4 and n=4,"([16, 1, 15, 3, 4, 4, 7, 8, 16, 3, 3, 9, 14, 6, 5, 7],)","[3, 4, 4, 7]",list(int) -> list(int)
+3093,caesar-cipher-k-modulo-n with k=1 and n=5,"([4, 3, 2, 4, 2],)","[0, 4, 3, 0, 3]",list(int) -> list(int)
+3094,replace-all-with-index-k with k=1,"([6],)",[6],list(int) -> list(int)
+3095,prepend-index-k with k=1,"([7, 10, 5, 13, 1, 6, 11, 10],)","[7, 7, 10, 5, 13, 1, 6, 11, 10]",list(int) -> list(int)
+3096,is-mod-k with k=3,"([9, 3, 7, 14],)",False,list(int) -> bool
+3097,append-index-k with k=1,"([10, 0, 8, 6, 4, 9, 7, 7],)","[10, 0, 8, 6, 4, 9, 7, 7, 10]",list(int) -> list(int)
+3098,kth-smallest with k=5,"([6, 3, 5, 7, 6, 5, 11],)",6,list(int) -> int
+3099,remove eq 1,"([2, 6, 4, 1, 3],)","[2, 6, 4, 3]",list(int) -> list(int)
+3100,modulo-k with k=2,"([],)",[],list(int) -> list(int)
+3101,slice-k-n with k=2 and n=4,"([11, 0, 1, 12, 11, 4, 8, 0],)","[0, 1, 12, 11]",list(int) -> list(int)
+3102,keep eq 2,"([4, 3, 4, 4, 5],)",[],list(int) -> list(int)
+3103,bool-identify-geq-k with k=2,"([1],)",[False],list(int) -> list(bool)
+3104,prepend-k with k=1,"([5, 10, 10, 14, 10, 8, 6],)","[1, 5, 10, 10, 14, 10, 8, 6]",list(int) -> list(int)
+3105,remove eq 3,"([3, 6, 3, 6, 1],)","[6, 6, 1]",list(int) -> list(int)
+3106,is-squares,"([9, 10, 11],)",False,list(int) -> bool
+3107,has-k with k=1,"([1, 1, 1, 1],)",True,list(int) -> bool
+3108,bool-identify-is-mod-k with k=1,"([],)",[],list(int) -> list(bool)
+3109,add-k with k=3,"([3],)",[6],list(int) -> list(int)
+3110,has-k with k=2,"([1, 2, 9, 16],)",True,list(int) -> bool
+3111,append-index-k with k=5,"([13, 2, 13, 16, 1, 3],)","[13, 2, 13, 16, 1, 3, 1]",list(int) -> list(int)
+3112,take-k with k=5,"([13, 13, 2, 2, 3, 9, 16, 10, 15],)","[13, 13, 2, 2, 3]",list(int) -> list(int)
+3113,take-k with k=4,"([3, 10, 3, 15],)","[3, 10, 3, 15]",list(int) -> list(int)
+3114,last,"([14, 0, 7, 3, 15, 11],)",11,list(int) -> int
+3115,count-k with k=5,"([14],)",0,list(int) -> int
+3116,add-k with k=1,"([7, 9, 8, 1, 12, 3],)","[8, 10, 9, 2, 13, 4]",list(int) -> list(int)
+3117,remove gt 0,"([2, 3, 3, 4, 4],)",[],list(int) -> list(int)
+3118,keep-mod-k with k=2,"([9, 4, 1, 5, 8],)","[4, 8]",list(int) -> list(int)
+3119,prepend-k with k=5,"([3],)","[5, 3]",list(int) -> list(int)
+3120,index-k with k=3,"([12, 15, 10, 10, 3, 8, 1, 11, 6],)",10,list(int) -> int
+3121,rotate-k with k=3,"([4, 3, 12, 6, 2, 11, 16, 10, 9, 10, 13, 6, 3],)","[13, 6, 3, 4, 3, 12, 6, 2, 11, 16, 10, 9, 10]",list(int) -> list(int)
+3122,slice-k-n with k=3 and n=5,"([1, 0, 5, 5, 13, 10, 14, 4, 11],)","[5, 5, 13, 10, 14]",list(int) -> list(int)
+3123,append-k with k=3,"([8, 1, 9, 3, 13, 5, 7],)","[8, 1, 9, 3, 13, 5, 7, 3]",list(int) -> list(int)
+3124,slice-k-n with k=3 and n=2,"([15, 0, 8, 12, 3, 0, 14, 1],)","[8, 12]",list(int) -> list(int)
+3125,kth-smallest with k=2,"([9, 5],)",9,list(int) -> int
+3126,is-mod-k with k=5,"([0, 10, 3, 3, 10, 4],)",False,list(int) -> bool
+3127,append-index-k with k=2,"([13, 12, 1, 2, 5, 1, 14],)","[13, 12, 1, 2, 5, 1, 14, 12]",list(int) -> list(int)
+3128,slice-k-n with k=2 and n=3,"([11, 5, 2, 9, 12, 0, 3, 11, 9, 15],)","[5, 2, 9]",list(int) -> list(int)
+3129,kth-largest with k=2,"([15, 11, 4, 15, 14, 16, 2],)",15,list(int) -> int
+3130,slice-k-n with k=2 and n=4,"([0, 9, 8, 11, 6, 7, 6, 4, 4, 7],)","[9, 8, 11, 6]",list(int) -> list(int)
+3131,keep primes,"([0, 13, 5, 13, 37, 1, 11],)","[13, 5, 13, 37, 11]",list(int) -> list(int)
+3132,slice-k-n with k=4 and n=1,"([4, 8, 10, 12, 12, 3, 13, 4, 7, 10, 10],)",[12],list(int) -> list(int)
+3133,kth-largest with k=4,"([0, 6, 13, 5, 0, 5, 2, 14, 9, 3],)",6,list(int) -> int
+3134,keep gt 2,"([2, 3, 2, 2, 0],)",[3],list(int) -> list(int)
+3135,slice-k-n with k=5 and n=2,"([7, 15, 9, 9, 2, 2, 3, 8, 14, 6, 5, 6],)","[2, 2]",list(int) -> list(int)
+3136,bool-identify-k with k=2,"([3],)",[False],list(int) -> list(bool)
+3137,kth-smallest with k=4,"([0, 4, 7, 13, 6, 12, 4],)",6,list(int) -> int
+3138,slice-k-n with k=3 and n=3,"([6, 1, 1, 7, 1, 12, 3, 5, 1, 12, 11],)","[1, 7, 1]",list(int) -> list(int)
+3139,caesar-cipher-k-modulo-n with k=5 and n=4,"([0, 3, 1, 1, 0],)","[1, 0, 2, 2, 1]",list(int) -> list(int)
+3140,slice-k-n with k=5 and n=4,"([16, 3, 10, 5, 6, 16, 1, 11, 7, 13, 13, 13, 4],)","[6, 16, 1, 11]",list(int) -> list(int)
+3141,take-k with k=1,"([14, 12, 5, 12, 2, 10],)",[14],list(int) -> list(int)
+3142,caesar-cipher-k-modulo-n with k=5 and n=4,"([1, 0, 1, 2, 1, 2],)","[2, 1, 2, 3, 2, 3]",list(int) -> list(int)
+3143,has-k with k=0,"([],)",False,list(int) -> bool
+3144,bool-identify-k with k=0,"([0, 8],)","[True, False]",list(int) -> list(bool)
+3145,pow-k with k=5,"([0, 10, 4, 11],)","[0, 100000, 1024, 161051]",list(int) -> list(int)
+3146,mult-k with k=0,"([7],)",[0],list(int) -> list(int)
+3147,kth-smallest with k=5,"([14, 1, 15, 6, 0, 12, 11, 3, 15, 14],)",11,list(int) -> int
+3148,add-k with k=2,"([],)",[],list(int) -> list(int)
+3149,keep eq 1,"([6, 1, 3, 3, 1],)","[1, 1]",list(int) -> list(int)
+3150,caesar-cipher-k-modulo-n with k=3 and n=4,"([2, 0],)","[1, 3]",list(int) -> list(int)
+3151,add-k with k=4,"([],)",[],list(int) -> list(int)
+3152,odds,"([1, 8, 13, 9, 6, 8],)","[1, 13, 9]",list(int) -> list(int)
+3153,kth-smallest with k=5,"([11, 14, 2, 1, 3, 2, 13],)",11,list(int) -> int
+3154,slice-k-n with k=1 and n=5,"([15, 2, 10, 8, 8, 14, 6, 4, 8, 8, 16],)","[15, 2, 10, 8, 8]",list(int) -> list(int)
+3155,min,"([0],)",0,list(int) -> int
+3156,remove-mod-head,"([2, 9, 1, 6],)","[9, 1]",list(int) -> list(int)
+3157,mult-k with k=0,"([3, 8, 1, 13, 5],)","[0, 0, 0, 0, 0]",list(int) -> list(int)
+3158,prepend-k with k=2,"([],)",[2],list(int) -> list(int)
+3159,append-k with k=1,"([4, 0, 6, 13, 5, 15, 6],)","[4, 0, 6, 13, 5, 15, 6, 1]",list(int) -> list(int)
+3160,append-k with k=1,"([8, 14, 16, 4, 12],)","[8, 14, 16, 4, 12, 1]",list(int) -> list(int)
+3161,+1 maximum list,"([4, 10, 1, 5, 5],)",11,list(int) -> int
+3162,count-k with k=1,"([],)",0,list(int) -> int
+3163,rotate-k with k=4,"([11, 2, 8, 16, 9, 8, 11, 10, 14, 11, 16, 5, 15, 2, 5, 13],)","[15, 2, 5, 13, 11, 2, 8, 16, 9, 8, 11, 10, 14, 11, 16, 5]",list(int) -> list(int)
+3164,caesar-cipher-k-modulo-n with k=1 and n=5,"([0, 0, 2, 4, 0, 1, 0],)","[1, 1, 3, 0, 1, 2, 1]",list(int) -> list(int)
+3165,bool-identify-geq-k with k=4,"([7, 14, 7, 0],)","[True, True, True, False]",list(int) -> list(bool)
+3166,is-evens,"([24, 10, 30, 4, 14],)",True,list(int) -> bool
+3167,slice-k-n with k=5 and n=3,"([13, 12, 5, 15, 16, 16, 1, 7, 1, 15],)","[16, 16, 1]",list(int) -> list(int)
+3168,index-k with k=5,"([1, 5, 15, 15, 2, 10, 13, 15, 3, 7],)",2,list(int) -> int
+3169,remove eq 2,"([5, 2, 1, 4, 2],)","[5, 1, 4]",list(int) -> list(int)
+3170,keep primes,"([23, 5, 29, 5, 17, 37, 13],)","[23, 5, 29, 5, 17, 37, 13]",list(int) -> list(int)
+3171,append-index-k with k=1,"([15, 4, 3],)","[15, 4, 3, 15]",list(int) -> list(int)
+3172,is-mod-k with k=2,"([18, 12, 18, 22, 14, 10, 10],)",True,list(int) -> bool
+3173,pow-k with k=2,"([],)",[],list(int) -> list(int)
+3174,take-k with k=4,"([14, 15, 3, 1, 3, 1, 8, 2, 1, 8],)","[14, 15, 3, 1]",list(int) -> list(int)
+3175,drop-k with k=2,"([10, 5, 5],)",[5],list(int) -> list(int)
+3176,range,"(5,)","[0, 1, 2, 3, 4]",int -> list(int)
+3177,take-k with k=5,"([1, 0, 12, 11, 11, 0, 15, 1, 4, 6, 11],)","[1, 0, 12, 11, 11]",list(int) -> list(int)
+3178,last,"([2, 12, 11, 14, 15, 9],)",9,list(int) -> int
+3179,rotate-k with k=2,"([6, 0, 12, 11, 3, 15, 14, 13, 13, 4],)","[13, 4, 6, 0, 12, 11, 3, 15, 14, 13]",list(int) -> list(int)
+3180,bool-identify-k with k=1,"([16, 6, 8, 13, 14],)","[False, False, False, False, False]",list(int) -> list(bool)
+3181,caesar-cipher-k-modulo-n with k=4 and n=3,"([1, 0, 1, 1],)","[2, 1, 2, 2]",list(int) -> list(int)
+3182,prepend-k with k=4,"([16, 9, 3],)","[4, 16, 9, 3]",list(int) -> list(int)
+3183,keep gt 2,"([4, 1, 1, 2, 5],)","[4, 5]",list(int) -> list(int)
+3184,take-k with k=4,"([7, 13, 13, 8],)","[7, 13, 13, 8]",list(int) -> list(int)
+3185,replace-all-with-index-k with k=4,"([9, 11, 5, 6, 10, 0, 15, 6],)","[6, 6, 6, 6, 6, 6, 6, 6]",list(int) -> list(int)
+3186,prepend-index-k with k=1,"([1, 3, 13, 12, 5, 8],)","[1, 1, 3, 13, 12, 5, 8]",list(int) -> list(int)
+3187,evens,"([2, 5, 4, 2, 0, 5, 1, 1],)","[2, 4, 2, 0]",list(int) -> list(int)
+3188,bool-identify-is-mod-k with k=5,"([11, 10, 12, 13, 2],)","[False, True, False, False, False]",list(int) -> list(bool)
+3189,is-mod-k with k=2,"([9, 4, 9, 6],)",False,list(int) -> bool
+3190,prepend-index-k with k=4,"([13, 1, 3, 2, 14, 16, 8, 4],)","[2, 13, 1, 3, 2, 14, 16, 8, 4]",list(int) -> list(int)
+3191,take-k with k=3,"([2, 13, 16, 16, 1],)","[2, 13, 16]",list(int) -> list(int)
+3192,has-k with k=4,"([3],)",False,list(int) -> bool
+3193,mult-k with k=4,"([1, 6, 12, 1, 7],)","[4, 24, 48, 4, 28]",list(int) -> list(int)
+3194,slice-k-n with k=1 and n=4,"([0, 7, 13, 15, 0, 9, 4, 7, 12, 7, 6],)","[0, 7, 13, 15]",list(int) -> list(int)
+3195,max,"([0],)",0,list(int) -> int
+3196,bool-identify-geq-k with k=5,"([2, 0, 6, 1, 11, 0, 12],)","[False, False, True, False, True, False, True]",list(int) -> list(bool)
+3197,bool-identify-k with k=0,"([9, 15, 4, 7],)","[False, False, False, False]",list(int) -> list(bool)
+3198,is-primes,"([5, 11],)",True,list(int) -> bool
+3199,remove eq 0,"([4, 2, 1, 1, 3],)","[4, 2, 1, 1, 3]",list(int) -> list(int)
+3200,slice-k-n with k=2 and n=1,"([5, 15, 15, 13, 6],)",[15],list(int) -> list(int)
+3201,slice-k-n with k=1 and n=3,"([13, 12, 5, 0, 6, 6, 4, 2, 2, 11],)","[13, 12, 5]",list(int) -> list(int)
+3202,take-k with k=4,"([9, 1, 6, 11],)","[9, 1, 6, 11]",list(int) -> list(int)
+3203,bool-identify-geq-k with k=5,"([],)",[],list(int) -> list(bool)
+3204,is-mod-k with k=3,"([33, 33, 3, 21, 9, 6],)",True,list(int) -> bool
+3205,last,"([16],)",16,list(int) -> int
+3206,remove-mod-k with k=5,"([12, 30],)",[12],list(int) -> list(int)
+3207,modulo-k with k=4,"([1, 14, 11, 13, 0, 3, 2],)","[1, 2, 3, 1, 0, 3, 2]",list(int) -> list(int)
+3208,is-mod-k with k=3,"([39, 39, 48, 30],)",True,list(int) -> bool
+3209,replace-all-with-index-k with k=2,"([4, 14, 15, 1, 4, 5, 12],)","[14, 14, 14, 14, 14, 14, 14]",list(int) -> list(int)
+3210,remove-index-k with k=5,"([15, 3, 7, 0, 4, 7, 13, 6, 12, 4, 11],)","[15, 3, 7, 0, 7, 13, 6, 12, 4, 11]",list(int) -> list(int)
+3211,pow-k with k=2,"([7, 8, 1, 9],)","[49, 64, 1, 81]",list(int) -> list(int)
+3212,keep eq 0,"([3, 0, 3, 2, 4],)",[0],list(int) -> list(int)
+3213,modulo-k with k=2,"([14, 14, 16],)","[0, 0, 0]",list(int) -> list(int)
+3214,rotate-k with k=4,"([15, 3, 16, 12, 14, 13, 5, 8, 8, 9],)","[5, 8, 8, 9, 15, 3, 16, 12, 14, 13]",list(int) -> list(int)
+3215,mult-k with k=2,"([],)",[],list(int) -> list(int)
+3216,take-k with k=2,"([11, 2, 1, 14, 8, 6, 9],)","[11, 2]",list(int) -> list(int)
+3217,keep primes,"([3, 7, 6, 5, 5, 7, 17],)","[3, 7, 5, 5, 7, 17]",list(int) -> list(int)
+3218,kth-smallest with k=4,"([3, 3, 16, 6, 16, 4],)",6,list(int) -> int
+3219,prepend-index-k with k=1,"([8, 5, 11],)","[8, 8, 5, 11]",list(int) -> list(int)
+3220,remove-index-k with k=3,"([1, 9, 16, 8, 11, 16, 13],)","[1, 9, 8, 11, 16, 13]",list(int) -> list(int)
+3221,caesar-cipher-k-modulo-n with k=5 and n=3,"([1, 1, 0, 2],)","[0, 0, 2, 1]",list(int) -> list(int)
+3222,has-head-in-tail,"([14, 3, 14, 11],)",True,list(int) -> bool
+3223,add-k with k=1,"([],)",[],list(int) -> list(int)
+3224,replace-all-with-index-k with k=2,"([9, 10, 9, 13, 0],)","[10, 10, 10, 10, 10]",list(int) -> list(int)
+3225,slice-k-n with k=4 and n=3,"([0, 1, 7, 16, 12, 13, 12, 1, 2],)","[16, 12, 13]",list(int) -> list(int)
+3226,slice-k-n with k=2 and n=4,"([16, 1, 13, 11, 14, 9, 8, 12, 8, 5, 8, 3],)","[1, 13, 11, 14]",list(int) -> list(int)
+3227,slice-k-n with k=5 and n=4,"([13, 2, 16, 15, 14, 4, 10, 0, 10, 0, 3],)","[14, 4, 10, 0]",list(int) -> list(int)
+3228,take-k with k=2,"([7, 10, 3, 0, 7, 7],)","[7, 10]",list(int) -> list(int)
+3229,caesar-cipher-k-modulo-n with k=3 and n=2,"([1],)",[0],list(int) -> list(int)
+3230,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 3, 2],)","[0, 1, 0]",list(int) -> list(int)
+3231,sum,"([3, 5, 7, 4, 4, 6],)",29,list(int) -> int
+3232,is-evens,"([8, 4],)",True,list(int) -> bool
+3233,slice-k-n with k=3 and n=1,"([3, 1, 10, 10, 16, 4, 9, 14, 15],)",[10],list(int) -> list(int)
+3234,slice-k-n with k=4 and n=3,"([0, 8, 0, 13, 14, 11, 6, 7, 13, 11, 1, 3],)","[13, 14, 11]",list(int) -> list(int)
+3235,prepend-index-k with k=4,"([2, 8, 16, 0, 1, 16, 0, 10, 13, 7],)","[0, 2, 8, 16, 0, 1, 16, 0, 10, 13, 7]",list(int) -> list(int)
+3236,modulo-k with k=1,"([],)",[],list(int) -> list(int)
+3237,rotate-k with k=1,"([5, 14, 10, 5, 2, 16, 10, 1, 9, 16],)","[16, 5, 14, 10, 5, 2, 16, 10, 1, 9]",list(int) -> list(int)
+3238,+1 maximum list,"([7, 1, 8],)",9,list(int) -> int
+3239,remove-mod-head,"([13, 4, 0, 3, 4],)","[4, 3, 4]",list(int) -> list(int)
+3240,drop-k with k=5,"([14, 2, 8, 4, 1, 9, 9, 4],)","[9, 9, 4]",list(int) -> list(int)
+3241,count-k with k=3,"([],)",0,list(int) -> int
+3242,has-k with k=1,"([11, 1, 7, 8, 4, 5, 6],)",True,list(int) -> bool
+3243,slice-k-n with k=5 and n=4,"([11, 13, 13, 3, 4, 15, 1, 7, 10, 13, 7],)","[4, 15, 1, 7]",list(int) -> list(int)
+3244,is-primes,"([2],)",True,list(int) -> bool
+3245,remove gt 0,"([4, 0, 5, 3, 5],)",[0],list(int) -> list(int)
+3246,repeat-k with k=4,"([15, 10],)","[15, 10, 15, 10, 15, 10, 15, 10]",list(int) -> list(int)
+3247,remove-mod-k with k=3,"([7, 15, 6],)",[7],list(int) -> list(int)
+3248,remove empty lists,"([[True], [True, True], [], []],)","[[True], [True, True]]",list(list(bool)) -> list(list(bool))
+3249,slice-k-n with k=1 and n=5,"([10, 12, 3, 12, 5, 14, 2, 5, 1, 13],)","[10, 12, 3, 12, 5]",list(int) -> list(int)
+3250,bool-identify-geq-k with k=3,"([5, 5, 16],)","[True, True, True]",list(int) -> list(bool)
+3251,is-mod-k with k=4,"([0, 12, 40, 48, 16, 20],)",True,list(int) -> bool
+3252,min,"([15, 5, 8, 12],)",5,list(int) -> int
+3253,bool-identify-is-mod-k with k=3,"([3],)",[True],list(int) -> list(bool)
+3254,remove-index-k with k=4,"([15, 1, 4, 12],)","[15, 1, 4]",list(int) -> list(int)
+3255,slice-k-n with k=5 and n=1,"([7, 12, 1, 4, 5, 14, 3],)",[5],list(int) -> list(int)
+3256,prepend-k with k=5,"([10, 9, 8, 16],)","[5, 10, 9, 8, 16]",list(int) -> list(int)
+3257,drop-k with k=3,"([10, 15, 13, 9, 13, 15, 7, 12, 3, 14],)","[9, 13, 15, 7, 12, 3, 14]",list(int) -> list(int)
+3258,rotate-k with k=2,"([0, 13, 14, 13, 1, 14, 12],)","[14, 12, 0, 13, 14, 13, 1]",list(int) -> list(int)
+3259,sort,"([2, 0, 4],)","[0, 2, 4]",list(int) -> list(int)
+3260,bool-identify-is-mod-k with k=1,"([12],)",[True],list(int) -> list(bool)
+3261,has-k with k=3,"([3, 6],)",True,list(int) -> bool
+3262,min,"([10, 14, 2],)",2,list(int) -> int
+3263,caesar-cipher-k-modulo-n with k=3 and n=4,"([],)",[],list(int) -> list(int)
+3264,last,"([16],)",16,list(int) -> int
+3265,slice-k-n with k=2 and n=4,"([7, 7, 8, 3, 4, 0, 14, 4, 10, 7, 15, 6],)","[7, 8, 3, 4]",list(int) -> list(int)
+3266,remove eq 0,"([3, 3, 2, 6, 2],)","[3, 3, 2, 6, 2]",list(int) -> list(int)
+3267,repeat-k with k=4,"([5, 8, 13, 0],)","[5, 8, 13, 0, 5, 8, 13, 0, 5, 8, 13, 0, 5, 8, 13, 0]",list(int) -> list(int)
+3268,is-mod-k with k=2,"([7],)",False,list(int) -> bool
+3269,rotate-k with k=1,"([8, 5, 16, 12, 11],)","[11, 8, 5, 16, 12]",list(int) -> list(int)
+3270,slice-k-n with k=1 and n=5,"([2, 12, 15, 7, 10, 4, 14, 11, 7],)","[2, 12, 15, 7, 10]",list(int) -> list(int)
+3271,replace-all-with-index-k with k=3,"([14, 0, 6, 5, 14, 1, 2, 5, 3],)","[6, 6, 6, 6, 6, 6, 6, 6, 6]",list(int) -> list(int)
+3272,index-k with k=3,"([12, 14, 15, 4, 8, 1, 0, 10, 8, 0],)",15,list(int) -> int
+3273,keep eq 2,"([2, 0, 4, 5, 2],)","[2, 2]",list(int) -> list(int)
+3274,bool-identify-k with k=1,"([1, 2, 9, 16],)","[True, False, False, False]",list(int) -> list(bool)
+3275,mult-k with k=5,"([12, 2, 8, 5],)","[60, 10, 40, 25]",list(int) -> list(int)
+3276,prepend-k with k=3,"([13, 8, 9, 4, 0],)","[3, 13, 8, 9, 4, 0]",list(int) -> list(int)
+3277,take-k with k=1,"([4, 3, 14],)",[4],list(int) -> list(int)
+3278,bool-identify-geq-k with k=4,"([4],)",[True],list(int) -> list(bool)
+3279,append-index-k with k=3,"([9, 5, 2, 15, 8, 1],)","[9, 5, 2, 15, 8, 1, 2]",list(int) -> list(int)
+3280,slice-k-n with k=1 and n=5,"([7, 4, 1, 16, 9, 16, 14, 6, 15, 2, 9, 1],)","[7, 4, 1, 16, 9]",list(int) -> list(int)
+3281,append-k with k=4,"([13],)","[13, 4]",list(int) -> list(int)
+3282,slice-k-n with k=3 and n=3,"([9, 5, 7, 11, 0, 7, 16],)","[7, 11, 0]",list(int) -> list(int)
+3283,rotate-k with k=2,"([2, 12, 6, 9],)","[6, 9, 2, 12]",list(int) -> list(int)
+3284,append-index-k with k=1,"([12, 7, 2, 2, 9, 11, 14],)","[12, 7, 2, 2, 9, 11, 14, 12]",list(int) -> list(int)
+3285,has-head-in-tail,"([6, 6, 16, 6, 2],)",True,list(int) -> bool
+3286,keep gt 2,"([3, 3, 5, 5, 3],)","[3, 3, 5, 5, 3]",list(int) -> list(int)
+3287,keep gt 3,"([5, 4, 2, 0, 1],)","[5, 4]",list(int) -> list(int)
+3288,is-mod-k with k=5,"([65, 35, 5, 35, 5, 80],)",True,list(int) -> bool
+3289,remove-mod-head,"([3, 1, 3, 4, 7, 6, 9, 2],)","[1, 4, 7, 2]",list(int) -> list(int)
+3290,bool-identify-geq-k with k=2,"([9, 13, 10, 11, 11],)","[True, True, True, True, True]",list(int) -> list(bool)
+3291,has-k with k=1,"([6, 14, 4],)",False,list(int) -> bool
+3292,remove eq 1,"([1, 2, 5, 0, 4],)","[2, 5, 0, 4]",list(int) -> list(int)
+3293,bool-identify-is-prime,"([3, 6],)","[True, False]",list(int) -> list(bool)
+3294,prepend-index-k with k=5,"([6, 15, 14, 11, 13, 15, 13, 11, 9],)","[13, 6, 15, 14, 11, 13, 15, 13, 11, 9]",list(int) -> list(int)
+3295,bool-identify-is-mod-k with k=1,"([12, 3, 14],)","[True, True, True]",list(int) -> list(bool)
+3296,slice-k-n with k=3 and n=3,"([15, 5, 13, 13, 16, 11, 3, 7],)","[13, 13, 16]",list(int) -> list(int)
+3297,keep gt 1,"([3, 6, 4, 1, 6],)","[3, 6, 4, 6]",list(int) -> list(int)
+3298,kth-largest with k=1,"([3, 15, 1],)",15,list(int) -> int
+3299,sum,"([14, 6],)",20,list(int) -> int
+3300,has-k with k=0,"([9, 12],)",False,list(int) -> bool
+3301,max,"([1, 1, 2, 1],)",2,list(int) -> int
+3302,reverse,"([],)",[],list(int) -> list(int)
+3303,sort,"([15],)",[15],list(int) -> list(int)
+3304,slice-k-n with k=4 and n=1,"([16, 10, 10, 2, 9, 6, 10, 4, 1, 7, 14, 8],)",[2],list(int) -> list(int)
+3305,slice-k-n with k=4 and n=5,"([12, 11, 15, 8, 8, 10, 5, 5, 5, 14, 16],)","[8, 8, 10, 5, 5]",list(int) -> list(int)
+3306,keep-mod-k with k=3,"([8, 12, 6, 12],)","[12, 6, 12]",list(int) -> list(int)
+3307,keep gt 0,"([3, 3, 2, 4, 0],)","[3, 3, 2, 4]",list(int) -> list(int)
+3308,mult-k with k=2,"([9, 13, 13, 15, 3, 6, 1],)","[18, 26, 26, 30, 6, 12, 2]",list(int) -> list(int)
+3309,modulo-k with k=1,"([14, 14, 14, 0, 7, 3],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+3310,has-k with k=5,"([12, 3, 14],)",False,list(int) -> bool
+3311,empty,"([4],)",False,list(int) -> bool
+3312,bool-identify-geq-k with k=4,"([3],)",[False],list(int) -> list(bool)
+3313,modulo-k with k=1,"([15, 9, 8, 8, 4, 3],)","[0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+3314,remove-index-k with k=1,"([8, 10, 12, 11, 8, 8],)","[10, 12, 11, 8, 8]",list(int) -> list(int)
+3315,replace-all-with-index-k with k=5,"([9, 12, 12, 15, 13, 16, 5, 13],)","[13, 13, 13, 13, 13, 13, 13, 13]",list(int) -> list(int)
+3316,max,"([4, 12],)",12,list(int) -> int
+3317,keep gt 0,"([4, 0, 3, 0, 2],)","[4, 3, 2]",list(int) -> list(int)
+3318,slice-k-n with k=2 and n=5,"([15, 5, 3, 3, 12, 2, 11, 16, 6, 6, 12, 9, 13, 15, 0],)","[5, 3, 3, 12, 2]",list(int) -> list(int)
+3319,count-k with k=5,"([5, 5, 2, 5, 5, 5],)",5,list(int) -> int
+3320,slice-k-n with k=5 and n=2,"([15, 10, 14, 9, 4, 7, 1, 7, 1, 1, 5, 8],)","[4, 7]",list(int) -> list(int)
+3321,caesar-cipher-k-modulo-n with k=1 and n=3,"([2, 2, 1, 1, 2, 1, 0],)","[0, 0, 2, 2, 0, 2, 1]",list(int) -> list(int)
+3322,bool-identify-k with k=0,"([10, 15],)","[False, False]",list(int) -> list(bool)
+3323,prepend-index-k with k=4,"([16, 13, 9, 8, 8, 0, 2, 15, 9],)","[8, 16, 13, 9, 8, 8, 0, 2, 15, 9]",list(int) -> list(int)
+3324,bool-identify-geq-k with k=1,"([12, 5, 7, 7, 2],)","[True, True, True, True, True]",list(int) -> list(bool)
+3325,is-evens,"([28],)",True,list(int) -> bool
+3326,add-k with k=3,"([],)",[],list(int) -> list(int)
+3327,add-k with k=4,"([4, 7, 15, 3, 2],)","[8, 11, 19, 7, 6]",list(int) -> list(int)
+3328,keep eq 0,"([6, 0, 0, 2, 5],)","[0, 0]",list(int) -> list(int)
+3329,index-k with k=4,"([4, 6, 12, 8],)",8,list(int) -> int
+3330,kth-smallest with k=1,"([3, 14],)",3,list(int) -> int
+3331,mult-k with k=2,"([4, 16, 1, 8, 4, 7],)","[8, 32, 2, 16, 8, 14]",list(int) -> list(int)
+3332,count-k with k=1,"([],)",0,list(int) -> int
+3333,pow-k with k=5,"([4, 4, 12, 7, 13, 9],)","[1024, 1024, 248832, 16807, 371293, 59049]",list(int) -> list(int)
+3334,bool-identify-geq-k with k=2,"([9, 0, 4, 3, 1, 10, 0],)","[True, False, True, True, False, True, False]",list(int) -> list(bool)
+3335,slice-k-n with k=4 and n=5,"([8, 4, 13, 6, 7, 13, 7, 5, 15, 11, 8, 13, 6, 1, 0],)","[6, 7, 13, 7, 5]",list(int) -> list(int)
+3336,count-k with k=4,"([4, 4, 4, 12],)",3,list(int) -> int
+3337,product,"([1, 2, 3],)",6,list(int) -> int
+3338,keep-mod-k with k=4,"([4, 12, 3, 15, 5, 5],)","[4, 12]",list(int) -> list(int)
+3339,keep-mod-k with k=5,"([5, 9],)",[5],list(int) -> list(int)
+3340,repeat,"([4, 3],)","[3, 3, 3, 3]",list(int) -> list(int)
+3341,slice-k-n with k=3 and n=3,"([16, 16, 12, 7, 5, 4, 15, 1, 11, 1],)","[12, 7, 5]",list(int) -> list(int)
+3342,remove gt 2,"([6, 3, 1, 6, 6],)",[1],list(int) -> list(int)
+3343,caesar-cipher-k-modulo-n with k=4 and n=3,"([0, 0],)","[1, 1]",list(int) -> list(int)
+3344,remove eq 1,"([4, 4, 0, 3, 2],)","[4, 4, 0, 3, 2]",list(int) -> list(int)
+3345,prepend-index-k with k=4,"([5, 4, 14, 5, 13, 5, 9, 9, 15, 13],)","[5, 5, 4, 14, 5, 13, 5, 9, 9, 15, 13]",list(int) -> list(int)
+3346,rotate-k with k=2,"([16, 2, 16, 6, 8, 12, 12, 3, 6, 8, 5, 5],)","[5, 5, 16, 2, 16, 6, 8, 12, 12, 3, 6, 8]",list(int) -> list(int)
+3347,keep-mod-k with k=3,"([],)",[],list(int) -> list(int)
+3348,kth-largest with k=3,"([3, 9, 1, 7, 12, 5, 12, 4, 14, 12],)",12,list(int) -> int
+3349,modulo-k with k=4,"([15, 4, 8, 1, 0, 10],)","[3, 0, 0, 1, 0, 2]",list(int) -> list(int)
+3350,append-index-k with k=5,"([9, 11, 8, 0, 7, 8],)","[9, 11, 8, 0, 7, 8, 7]",list(int) -> list(int)
+3351,index-k with k=2,"([1, 11],)",11,list(int) -> int
+3352,remove-index-k with k=1,"([13],)",[],list(int) -> list(int)
+3353,bool-identify-is-mod-k with k=3,"([1, 6],)","[False, True]",list(int) -> list(bool)
+3354,slice-k-n with k=1 and n=2,"([12, 14, 1, 6, 5, 13, 3, 13, 11, 15],)","[12, 14]",list(int) -> list(int)
+3355,append-k with k=3,"([6, 7, 9, 14],)","[6, 7, 9, 14, 3]",list(int) -> list(int)
+3356,prepend-k with k=4,"([6, 5, 3, 16, 7, 16, 5],)","[4, 6, 5, 3, 16, 7, 16, 5]",list(int) -> list(int)
+3357,append-k with k=0,"([2, 2, 9],)","[2, 2, 9, 0]",list(int) -> list(int)
+3358,append-k with k=1,"([0, 12, 5, 16, 2, 5, 12],)","[0, 12, 5, 16, 2, 5, 12, 1]",list(int) -> list(int)
+3359,caesar-cipher-k-modulo-n with k=2 and n=4,"([0, 3, 3],)","[2, 1, 1]",list(int) -> list(int)
+3360,mult-k with k=3,"([10, 0, 1, 2, 6, 4],)","[30, 0, 3, 6, 18, 12]",list(int) -> list(int)
+3361,append-k with k=4,"([11, 14, 14, 0, 5, 10],)","[11, 14, 14, 0, 5, 10, 4]",list(int) -> list(int)
+3362,slice-k-n with k=1 and n=4,"([15, 10, 11, 14, 12, 12, 14],)","[15, 10, 11, 14]",list(int) -> list(int)
+3363,remove-mod-k with k=5,"([0, 5],)",[],list(int) -> list(int)
+3364,reverse,"([],)",[],list(int) -> list(int)
+3365,count-k with k=0,"([9, 7, 2, 6],)",0,list(int) -> int
+3366,slice-k-n with k=3 and n=5,"([5, 11, 10, 6, 5, 14, 1, 2, 4, 1, 2, 5, 6, 15],)","[10, 6, 5, 14, 1]",list(int) -> list(int)
+3367,keep eq 2,"([3, 6, 1, 0, 5],)",[],list(int) -> list(int)
+3368,count-k with k=5,"([0, 1, 2, 14, 3, 9, 12],)",0,list(int) -> int
+3369,is-mod-k with k=2,"([12, 16, 28, 16, 4, 2],)",True,list(int) -> bool
+3370,has-k with k=4,"([16, 14, 7, 8, 7, 1, 3],)",False,list(int) -> bool
+3371,modulo-k with k=1,"([7, 8, 1, 9],)","[0, 0, 0, 0]",list(int) -> list(int)
+3372,bool-identify-k with k=5,"([5, 5, 5, 5, 5],)","[True, True, True, True, True]",list(int) -> list(bool)
+3373,keep-mod-k with k=5,"([],)",[],list(int) -> list(int)
+3374,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 3, 2, 4, 2],)","[1, 0, 4, 1, 4]",list(int) -> list(int)
+3375,remove empty lists,"([[True], [True], [False], [False, False, True]],)","[[True], [True], [False], [False, False, True]]",list(list(bool)) -> list(list(bool))
+3376,prepend-k with k=1,"([15, 15, 15, 12, 8, 12],)","[1, 15, 15, 15, 12, 8, 12]",list(int) -> list(int)
+3377,replace-all-with-index-k with k=4,"([0, 9, 16, 3, 3, 11, 16, 0],)","[3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+3378,append-k with k=5,"([5],)","[5, 5]",list(int) -> list(int)
+3379,slice-k-n with k=5 and n=2,"([9, 9, 11, 10, 14, 11, 13, 12, 10, 16],)","[14, 11]",list(int) -> list(int)
+3380,bool-identify-k with k=4,"([6, 4, 4, 0],)","[False, True, True, False]",list(int) -> list(bool)
+3381,has-k with k=3,"([3, 3, 3, 3],)",True,list(int) -> bool
+3382,count-k with k=5,"([5, 0],)",1,list(int) -> int
+3383,kth-largest with k=1,"([6, 4, 15, 0],)",15,list(int) -> int
+3384,slice-k-n with k=5 and n=4,"([11, 15, 13, 3, 10, 16, 13, 3, 11, 5, 15, 6, 6, 14, 6, 10, 9],)","[10, 16, 13, 3]",list(int) -> list(int)
+3385,has-k with k=5,"([11, 0, 5, 5, 5, 5, 5],)",True,list(int) -> bool
+3386,append-index-k with k=3,"([3, 13, 5, 7, 4, 3, 3],)","[3, 13, 5, 7, 4, 3, 3, 5]",list(int) -> list(int)
+3387,keep-mod-k with k=2,"([6, 8, 6, 14, 11, 4, 15],)","[6, 8, 6, 14, 4]",list(int) -> list(int)
+3388,remove gt 2,"([1, 5, 5, 6, 3],)",[1],list(int) -> list(int)
+3389,kth-smallest with k=3,"([16, 16, 4, 0, 3, 4, 9],)",4,list(int) -> int
+3390,slice-k-n with k=2 and n=1,"([3, 0, 3, 0, 11, 2, 1, 0, 8, 1, 15],)",[0],list(int) -> list(int)
+3391,take-k with k=1,"([15, 0, 4, 1],)",[15],list(int) -> list(int)
+3392,bool-identify-geq-k with k=0,"([10, 15, 5, 16, 9, 7, 9],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+3393,repeat-many,"([1, 0, 1],)","[0, 1]",list(int) -> list(int)
+3394,slice-k-n with k=1 and n=3,"([15, 14, 7, 2, 13, 14, 7],)","[15, 14, 7]",list(int) -> list(int)
+3395,modulo-k with k=1,"([1, 16, 5, 15, 8, 10, 13],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+3396,remove-mod-k with k=4,"([10, 3, 5, 8, 3, 7],)","[10, 3, 5, 3, 7]",list(int) -> list(int)
+3397,bool-identify-geq-k with k=1,"([1, 2, 15, 11, 14, 1],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+3398,slice-k-n with k=2 and n=3,"([2, 15, 1, 6, 7, 10, 1, 8, 8, 7, 8],)","[15, 1, 6]",list(int) -> list(int)
+3399,repeat-k with k=2,"([4, 11, 11, 12],)","[4, 11, 11, 12, 4, 11, 11, 12]",list(int) -> list(int)
+3400,take-k with k=4,"([1, 11, 15, 7, 12],)","[1, 11, 15, 7]",list(int) -> list(int)
+3401,replace-all-with-index-k with k=3,"([2, 14, 16, 10, 9, 6],)","[16, 16, 16, 16, 16, 16]",list(int) -> list(int)
+3402,remove-index-k with k=1,"([6, 0],)",[0],list(int) -> list(int)
+3403,append-k with k=1,"([13, 11, 5, 1],)","[13, 11, 5, 1, 1]",list(int) -> list(int)
+3404,keep eq 3,"([6, 6, 0, 6, 6],)",[],list(int) -> list(int)
+3405,slice-k-n with k=4 and n=5,"([6, 5, 16, 5, 5, 12, 12, 9, 9, 16, 14, 14],)","[5, 5, 12, 12, 9]",list(int) -> list(int)
+3406,index-k with k=5,"([9, 1, 6, 0, 4, 14, 15, 6, 6, 14, 4, 7],)",4,list(int) -> int
+3407,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 1, 2],)","[3, 2, 3]",list(int) -> list(int)
+3408,has-k with k=5,"([],)",False,list(int) -> bool
+3409,bool-identify-k with k=3,"([2, 8, 0, 14, 3, 10],)","[False, False, False, False, True, False]",list(int) -> list(bool)
+3410,count-head-in-tail,"([11],)",0,list(int) -> int
+3411,caesar-cipher-k-modulo-n with k=2 and n=4,"([2, 0, 2, 1, 3, 2],)","[0, 2, 0, 3, 1, 0]",list(int) -> list(int)
+3412,replace-all-with-index-k with k=1,"([14, 14],)","[14, 14]",list(int) -> list(int)
+3413,add-k with k=3,"([],)",[],list(int) -> list(int)
+3414,modulo-k with k=1,"([0, 15, 15, 16, 9],)","[0, 0, 0, 0, 0]",list(int) -> list(int)
+3415,count-k with k=5,"([5, 5, 5, 5, 5],)",5,list(int) -> int
+3416,append-k with k=1,"([7],)","[7, 1]",list(int) -> list(int)
+3417,slice-k-n with k=4 and n=2,"([0, 14, 0, 16, 0, 12, 0, 2, 7, 8, 5, 9, 10, 2],)","[16, 0]",list(int) -> list(int)
+3418,mult-k with k=5,"([16, 15, 1, 15],)","[80, 75, 5, 75]",list(int) -> list(int)
+3419,keep eq 3,"([4, 6, 6, 6, 3],)",[3],list(int) -> list(int)
+3420,remove gt 2,"([6, 3, 1, 5, 2],)","[1, 2]",list(int) -> list(int)
+3421,slice-k-n with k=1 and n=2,"([13, 13, 8, 0, 5, 14, 0, 2],)","[13, 13]",list(int) -> list(int)
+3422,keep eq 1,"([6, 2, 1, 5, 0],)",[1],list(int) -> list(int)
+3423,kth-largest with k=4,"([4, 8, 4, 5],)",4,list(int) -> int
+3424,keep eq 3,"([0, 1, 6, 2, 0],)",[],list(int) -> list(int)
+3425,slice-k-n with k=4 and n=2,"([8, 2, 9, 6, 5, 9, 12, 11, 11, 6],)","[6, 5]",list(int) -> list(int)
+3426,append-index-k with k=2,"([5, 1, 1, 13, 5, 0, 1],)","[5, 1, 1, 13, 5, 0, 1, 1]",list(int) -> list(int)
+3427,remove-mod-k with k=4,"([0, 24, 16, 24],)",[],list(int) -> list(int)
+3428,rotate-k with k=1,"([14, 1],)","[1, 14]",list(int) -> list(int)
+3429,remove eq 3,"([1, 2, 1, 4, 6],)","[1, 2, 1, 4, 6]",list(int) -> list(int)
+3430,slice-k-n with k=5 and n=3,"([14, 0, 6, 15, 5, 11, 9, 3, 7, 10],)","[5, 11, 9]",list(int) -> list(int)
+3431,bool-identify-geq-k with k=2,"([12],)",[True],list(int) -> list(bool)
+3432,prepend-k with k=5,"([14, 1, 4, 13, 1, 11, 12],)","[5, 14, 1, 4, 13, 1, 11, 12]",list(int) -> list(int)
+3433,slice-k-n with k=4 and n=4,"([12, 8, 6, 4, 5, 10, 8, 11, 9, 9, 16],)","[4, 5, 10, 8]",list(int) -> list(int)
+3434,modulo-k with k=4,"([14, 4, 12, 13],)","[2, 0, 0, 1]",list(int) -> list(int)
+3435,slice-k-n with k=2 and n=2,"([8, 3, 9, 11, 15, 7, 13, 4],)","[3, 9]",list(int) -> list(int)
+3436,slice-k-n with k=2 and n=5,"([10, 14, 14, 0, 16, 0, 9, 15, 1, 15, 10],)","[14, 14, 0, 16, 0]",list(int) -> list(int)
+3437,index-head,"([1, 2, 3],)",2,list(int) -> int
+3438,prepend-index-k with k=3,"([6, 10, 15, 8, 14, 3, 4, 16, 1],)","[15, 6, 10, 15, 8, 14, 3, 4, 16, 1]",list(int) -> list(int)
+3439,slice-k-n with k=1 and n=5,"([15, 6, 12, 11, 12, 12, 2],)","[15, 6, 12, 11, 12]",list(int) -> list(int)
+3440,slice-k-n with k=3 and n=3,"([16, 10, 5, 13, 10, 7, 5],)","[5, 13, 10]",list(int) -> list(int)
+3441,modulo-k with k=5,"([2, 6, 12],)","[2, 1, 2]",list(int) -> list(int)
+3442,take-k with k=2,"([7, 4, 4, 16],)","[7, 4]",list(int) -> list(int)
+3443,remove gt 1,"([2, 5, 3, 5, 4],)",[],list(int) -> list(int)
+3444,modulo-k with k=5,"([],)",[],list(int) -> list(int)
+3445,take-k with k=2,"([7, 6],)","[7, 6]",list(int) -> list(int)
+3446,keep eq 0,"([0, 5, 1, 0, 0],)","[0, 0, 0]",list(int) -> list(int)
+3447,mult-k with k=5,"([8],)",[40],list(int) -> list(int)
+3448,drop-k with k=2,"([15, 13, 0, 15, 8, 9, 16, 7, 6],)","[0, 15, 8, 9, 16, 7, 6]",list(int) -> list(int)
+3449,keep-mod-head,"([5, 15, 0, 20, 13, 7],)","[15, 0, 20]",list(int) -> list(int)
+3450,take-k with k=4,"([3, 9, 9, 10, 3, 3],)","[3, 9, 9, 10]",list(int) -> list(int)
+3451,kth-largest with k=2,"([12, 5, 7, 15, 6],)",12,list(int) -> int
+3452,take-k with k=3,"([11, 2, 16, 13, 6, 16, 8, 2, 11, 8],)","[11, 2, 16]",list(int) -> list(int)
+3453,prepend-k with k=3,"([7],)","[3, 7]",list(int) -> list(int)
+3454,drop-k with k=2,"([15, 11, 4, 15, 14, 16, 2],)","[4, 15, 14, 16, 2]",list(int) -> list(int)
+3455,bool-identify-k with k=3,"([],)",[],list(int) -> list(bool)
+3456,keep eq 2,"([4, 2, 2, 2, 2],)","[2, 2, 2, 2]",list(int) -> list(int)
+3457,kth-largest with k=2,"([10, 5, 5],)",5,list(int) -> int
+3458,add-k with k=4,"([],)",[],list(int) -> list(int)
+3459,len,"([13, 11, 10, 12, 13],)",5,list(int) -> int
+3460,has-k with k=0,"([6, 9, 11, 7, 5, 5, 0],)",True,list(int) -> bool
+3461,modulo-k with k=2,"([2, 0, 1, 11, 11, 10],)","[0, 0, 1, 1, 1, 0]",list(int) -> list(int)
+3462,bool-identify-k with k=2,"([2, 2, 2, 2, 2, 2],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+3463,append-k with k=4,"([3],)","[3, 4]",list(int) -> list(int)
+3464,product,"([16, 1, 14, 0, 12],)",0,list(int) -> int
+3465,take-k with k=3,"([1, 10, 10],)","[1, 10, 10]",list(int) -> list(int)
+3466,remove-mod-k with k=2,"([10, 10, 16, 7, 2],)",[7],list(int) -> list(int)
+3467,index-head,"([1, 6, 9, 3, 11, 1],)",6,list(int) -> int
+3468,remove-mod-k with k=5,"([20, 10, 5, 7],)",[7],list(int) -> list(int)
+3469,pop,"([0, 3, 2, 16],)","[0, 3, 2]",list(int) -> list(int)
+3470,slice-k-n with k=1 and n=2,"([6, 8, 7, 10, 2, 5, 3, 0, 15, 16, 3],)","[6, 8]",list(int) -> list(int)
+3471,remove gt 0,"([3, 3, 3, 4, 4],)",[],list(int) -> list(int)
+3472,drop-k with k=1,"([6, 4, 15, 0],)","[4, 15, 0]",list(int) -> list(int)
+3473,range,"(5,)","[0, 1, 2, 3, 4]",int -> list(int)
+3474,append-k with k=4,"([],)",[4],list(int) -> list(int)
+3475,prepend-k with k=4,"([0, 7, 1, 14],)","[4, 0, 7, 1, 14]",list(int) -> list(int)
+3476,kth-smallest with k=4,"([11, 12, 5, 13, 11, 4, 16, 0, 8],)",8,list(int) -> int
+3477,modulo-k with k=3,"([9],)",[0],list(int) -> list(int)
+3478,caesar-cipher-k-modulo-n with k=1 and n=4,"([2, 3, 1],)","[3, 0, 2]",list(int) -> list(int)
+3479,kth-smallest with k=5,"([3, 11, 8, 10, 9, 8],)",10,list(int) -> int
+3480,mult-k with k=3,"([0, 13, 3, 9, 1],)","[0, 39, 9, 27, 3]",list(int) -> list(int)
+3481,keep gt 0,"([1, 2, 0, 5, 2],)","[1, 2, 5, 2]",list(int) -> list(int)
+3482,head,"([11, 13, 15, 15, 0, 1, 3],)",11,list(int) -> int
+3483,caesar-cipher-k-modulo-n with k=4 and n=3,"([0],)",[1],list(int) -> list(int)
+3484,keep-mod-k with k=2,"([13, 9, 11, 13],)",[],list(int) -> list(int)
+3485,prepend-index-k with k=4,"([14, 10, 5, 16, 1, 1, 4, 13, 16, 15],)","[16, 14, 10, 5, 16, 1, 1, 4, 13, 16, 15]",list(int) -> list(int)
+3486,bool-identify-k with k=0,"([0, 0, 9],)","[True, True, False]",list(int) -> list(bool)
+3487,dup,"([5],)","[5, 5]",list(int) -> list(int)
+3488,add-k with k=3,"([2, 14, 15],)","[5, 17, 18]",list(int) -> list(int)
+3489,remove empty lists,"([[False, False, False], [True, False, True], [], [False]],)","[[False, False, False], [True, False, True], [False]]",list(list(bool)) -> list(list(bool))
+3490,caesar-cipher-k-modulo-n with k=5 and n=2,"([0, 0, 0, 1],)","[1, 1, 1, 0]",list(int) -> list(int)
+3491,caesar-cipher-k-modulo-n with k=1 and n=2,"([1, 0, 1, 0, 0, 1, 0],)","[0, 1, 0, 1, 1, 0, 1]",list(int) -> list(int)
+3492,append-index-k with k=1,"([4],)","[4, 4]",list(int) -> list(int)
+3493,prepend-index-k with k=3,"([13, 16, 6, 9, 16, 6, 10],)","[6, 13, 16, 6, 9, 16, 6, 10]",list(int) -> list(int)
+3494,add-k with k=3,"([1, 9, 7, 8],)","[4, 12, 10, 11]",list(int) -> list(int)
+3495,len,"([15, 15, 0, 1, 3, 16],)",6,list(int) -> int
+3496,slice-k-n with k=5 and n=3,"([10, 10, 5, 2, 1, 11, 8, 9, 6, 10, 6, 11, 11, 4],)","[1, 11, 8]",list(int) -> list(int)
+3497,count-k with k=1,"([1, 1, 1, 4, 1, 1],)",5,list(int) -> int
+3498,kth-smallest with k=2,"([0, 9, 6, 7, 15],)",6,list(int) -> int
+3499,is-mod-k with k=3,"([24, 0, 21],)",True,list(int) -> bool
+3500,append-index-k with k=4,"([12, 14, 1, 8, 0, 5, 7, 3],)","[12, 14, 1, 8, 0, 5, 7, 3, 8]",list(int) -> list(int)
+3501,repeat-k with k=2,"([11],)","[11, 11]",list(int) -> list(int)
+3502,mult-k with k=4,"([14, 6, 10, 2, 7],)","[56, 24, 40, 8, 28]",list(int) -> list(int)
+3503,bool-identify-k with k=0,"([0, 7],)","[True, False]",list(int) -> list(bool)
+3504,caesar-cipher-k-modulo-n with k=5 and n=4,"([2, 0, 1, 1],)","[3, 1, 2, 2]",list(int) -> list(int)
+3505,index-head,"([2, 1, 2],)",2,list(int) -> int
+3506,prepend-k with k=4,"([13, 1, 11, 16, 7],)","[4, 13, 1, 11, 16, 7]",list(int) -> list(int)
+3507,repeat,"([2, 3],)","[3, 3]",list(int) -> list(int)
+3508,remove-mod-head,"([10, 8, 7],)","[8, 7]",list(int) -> list(int)
+3509,repeat-k with k=3,"([7, 10, 5, 13, 1],)","[7, 10, 5, 13, 1, 7, 10, 5, 13, 1, 7, 10, 5, 13, 1]",list(int) -> list(int)
+3510,bool-identify-k with k=5,"([0, 1, 2, 14, 3, 9, 12],)","[False, False, False, False, False, False, False]",list(int) -> list(bool)
+3511,last,"([0],)",0,list(int) -> int
+3512,drop-k with k=5,"([15, 16, 16, 16, 6, 0, 4, 7],)","[0, 4, 7]",list(int) -> list(int)
+3513,take-k with k=2,"([5, 2, 13, 4, 15, 6, 14, 8],)","[5, 2]",list(int) -> list(int)
+3514,slice-k-n with k=4 and n=3,"([8, 15, 12, 16, 13, 5, 6, 2],)","[16, 13, 5]",list(int) -> list(int)
+3515,slice-k-n with k=3 and n=2,"([8, 8, 8, 15, 15, 16],)","[8, 15]",list(int) -> list(int)
+3516,bool-identify-geq-k with k=3,"([7, 11, 2, 3, 2, 2, 10],)","[True, True, False, True, False, False, True]",list(int) -> list(bool)
+3517,drop-k with k=4,"([12, 10, 12, 0, 2, 10, 9, 6],)","[2, 10, 9, 6]",list(int) -> list(int)
+3518,keep-mod-head,"([3, 24, 3, 9, 12],)","[24, 3, 9, 12]",list(int) -> list(int)
+3519,rotate-k with k=1,"([0, 12],)","[12, 0]",list(int) -> list(int)
+3520,caesar-cipher-k-modulo-n with k=4 and n=5,"([2, 1, 2, 4],)","[1, 0, 1, 3]",list(int) -> list(int)
+3521,slice-k-n with k=4 and n=4,"([6, 7, 15, 4, 8, 9, 13, 1, 7, 6, 1, 2, 7, 10, 14, 8],)","[4, 8, 9, 13]",list(int) -> list(int)
+3522,append-k with k=3,"([5, 13, 8, 15, 13, 7, 2],)","[5, 13, 8, 15, 13, 7, 2, 3]",list(int) -> list(int)
+3523,mult-k with k=0,"([],)",[],list(int) -> list(int)
+3524,modulo-k with k=3,"([12, 11, 8, 8],)","[0, 2, 2, 2]",list(int) -> list(int)
+3525,add-k with k=5,"([13, 8, 10],)","[18, 13, 15]",list(int) -> list(int)
+3526,append-index-k with k=2,"([4, 11, 8, 4, 10, 11, 4],)","[4, 11, 8, 4, 10, 11, 4, 11]",list(int) -> list(int)
+3527,keep gt 0,"([2, 2, 3, 5, 5],)","[2, 2, 3, 5, 5]",list(int) -> list(int)
+3528,add-k with k=4,"([11, 11, 1, 7, 3, 2],)","[15, 15, 5, 11, 7, 6]",list(int) -> list(int)
+3529,append-k with k=1,"([15, 5, 12, 2, 8],)","[15, 5, 12, 2, 8, 1]",list(int) -> list(int)
+3530,remove-mod-k with k=2,"([10, 11, 7],)","[11, 7]",list(int) -> list(int)
+3531,count-head-in-tail,"([2, 1, 2],)",1,list(int) -> int
+3532,has-k with k=2,"([5, 8, 4, 13, 12],)",False,list(int) -> bool
+3533,len,"([1, 2, 3],)",3,list(int) -> int
+3534,caesar-cipher-k-modulo-n with k=5 and n=3,"([2, 2, 1, 0, 0],)","[1, 1, 0, 2, 2]",list(int) -> list(int)
+3535,slice-k-n with k=5 and n=4,"([12, 4, 14, 10, 8, 12, 12, 9, 1, 0, 4, 0, 15, 13, 1, 11],)","[8, 12, 12, 9]",list(int) -> list(int)
+3536,kth-smallest with k=2,"([7, 4, 0, 1, 11, 0, 11],)",0,list(int) -> int
+3537,remove eq 2,"([0, 0, 6, 4, 1],)","[0, 0, 6, 4, 1]",list(int) -> list(int)
+3538,slice-k-n with k=5 and n=3,"([8, 6, 6, 11, 8, 5, 11, 3, 16, 6, 14, 15, 5, 2, 15],)","[8, 5, 11]",list(int) -> list(int)
+3539,add-k with k=4,"([0, 3, 8, 15, 3, 3, 0],)","[4, 7, 12, 19, 7, 7, 4]",list(int) -> list(int)
+3540,is-evens,"([5, 7, 14, 0, 13, 5, 9],)",False,list(int) -> bool
+3541,drop-k with k=3,"([11, 12, 13, 4, 0, 13, 6, 9, 1, 9],)","[4, 0, 13, 6, 9, 1, 9]",list(int) -> list(int)
+3542,remove-index-k with k=1,"([12, 14, 15, 4, 8, 1, 0, 10],)","[14, 15, 4, 8, 1, 0, 10]",list(int) -> list(int)
+3543,rotate-k with k=3,"([6, 7, 6, 12, 4, 8, 16, 4, 8, 15, 5, 8, 12, 7, 9],)","[12, 7, 9, 6, 7, 6, 12, 4, 8, 16, 4, 8, 15, 5, 8]",list(int) -> list(int)
+3544,remove-mod-head,"([3, 21, 9, 15],)",[],list(int) -> list(int)
+3545,count-k with k=0,"([0, 8],)",1,list(int) -> int
+3546,append-index-k with k=2,"([1, 7, 8, 8, 1, 5, 15, 6],)","[1, 7, 8, 8, 1, 5, 15, 6, 7]",list(int) -> list(int)
+3547,kth-smallest with k=1,"([12, 13],)",12,list(int) -> int
+3548,slice-k-n with k=3 and n=2,"([2, 1, 1, 8, 0, 10],)","[1, 8]",list(int) -> list(int)
+3549,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 2, 2],)","[1, 4, 4]",list(int) -> list(int)
+3550,slice-k-n with k=2 and n=4,"([10, 15, 5, 5, 0, 16, 12, 12, 8, 5, 4, 16],)","[15, 5, 5, 0]",list(int) -> list(int)
+3551,count-k with k=5,"([16],)",0,list(int) -> int
+3552,drop-k with k=2,"([2, 14, 6, 12],)","[6, 12]",list(int) -> list(int)
+3553,prepend-k with k=1,"([16, 3, 3, 9, 11, 6, 0],)","[1, 16, 3, 3, 9, 11, 6, 0]",list(int) -> list(int)
+3554,prepend-k with k=3,"([6, 0],)","[3, 6, 0]",list(int) -> list(int)
+3555,range +1 maximum list,"([8, 0, 2],)","[0, 1, 2, 3, 4, 5, 6, 7, 8]",list(int) -> list(int)
+3556,is-evens,"([2, 5, 4, 2, 0, 5, 1, 1],)",False,list(int) -> bool
+3557,remove eq 3,"([4, 4, 2, 2, 6],)","[4, 4, 2, 2, 6]",list(int) -> list(int)
+3558,append-k with k=1,"([],)",[1],list(int) -> list(int)
+3559,remove-index-k with k=1,"([14, 13, 8, 15, 8, 10, 0, 6],)","[13, 8, 15, 8, 10, 0, 6]",list(int) -> list(int)
+3560,count-k with k=3,"([12, 3, 14],)",1,list(int) -> int
+3561,slice-k-n with k=4 and n=2,"([3, 7, 8, 0, 7, 6, 8, 6, 9, 8],)","[0, 7]",list(int) -> list(int)
+3562,slice-k-n with k=1 and n=3,"([3, 5, 5, 7, 6, 16, 4, 2, 7],)","[3, 5, 5]",list(int) -> list(int)
+3563,replace-all-with-index-k with k=2,"([11, 14, 12],)","[14, 14, 14]",list(int) -> list(int)
+3564,caesar-cipher-k-modulo-n with k=1 and n=3,"([0],)",[1],list(int) -> list(int)
+3565,len,"([2, 7],)",2,list(int) -> int
+3566,remove gt 0,"([2, 5, 3, 2, 4],)",[],list(int) -> list(int)
+3567,repeat,"([3, 3],)","[3, 3, 3]",list(int) -> list(int)
+3568,slice-k-n with k=1 and n=5,"([14, 2, 3, 14, 10, 0, 12, 16, 13],)","[14, 2, 3, 14, 10]",list(int) -> list(int)
+3569,kth-smallest with k=2,"([13, 4, 8, 10, 3, 2],)",3,list(int) -> int
+3570,reverse,"([7, 13, 5, 7, 6],)","[6, 7, 5, 13, 7]",list(int) -> list(int)
+3571,bool-identify-geq-k with k=4,"([2, 0, 1, 15, 2, 4, 0],)","[False, False, False, True, False, True, False]",list(int) -> list(bool)
+3572,take-k with k=2,"([15, 0, 14, 12, 16, 15, 1, 14],)","[15, 0]",list(int) -> list(int)
+3573,product,"([3, 1, 5, 9, 13],)",1755,list(int) -> int
+3574,pow-k with k=5,"([16, 12],)","[1048576, 248832]",list(int) -> list(int)
+3575,caesar-cipher-k-modulo-n with k=2 and n=3,"([],)",[],list(int) -> list(int)
+3576,index-k with k=3,"([8, 14, 2, 12, 3, 6, 0],)",2,list(int) -> int
+3577,slice-k-n with k=2 and n=2,"([2, 13, 7, 10, 15],)","[13, 7]",list(int) -> list(int)
+3578,modulo-k with k=5,"([],)",[],list(int) -> list(int)
+3579,drop-k with k=2,"([13, 0],)",[],list(int) -> list(int)
+3580,repeat-k with k=3,"([10, 9],)","[10, 9, 10, 9, 10, 9]",list(int) -> list(int)
+3581,pow-k with k=2,"([15, 15, 0, 1, 3, 16],)","[225, 225, 0, 1, 9, 256]",list(int) -> list(int)
+3582,add-k with k=2,"([9, 12, 16, 9],)","[11, 14, 18, 11]",list(int) -> list(int)
+3583,remove gt 0,"([6, 5, 0, 6, 1],)",[0],list(int) -> list(int)
+3584,remove gt 2,"([5, 0, 1, 6, 6],)","[0, 1]",list(int) -> list(int)
+3585,remove-mod-head,"([8, 6, 7, 15, 2],)","[6, 7, 15, 2]",list(int) -> list(int)
+3586,caesar-cipher-k-modulo-n with k=2 and n=5,"([4, 3, 2, 3, 3, 1],)","[1, 0, 4, 0, 0, 3]",list(int) -> list(int)
+3587,keep primes,"([2, 3, 5, 5, 2, 31, 23],)","[2, 3, 5, 5, 2, 31, 23]",list(int) -> list(int)
+3588,caesar-cipher-k-modulo-n with k=3 and n=5,"([2, 0, 1, 2, 4, 3],)","[0, 3, 4, 0, 2, 1]",list(int) -> list(int)
+3589,append-k with k=0,"([],)",[0],list(int) -> list(int)
+3590,keep-mod-head,"([10, 2, 12, 9],)",[],list(int) -> list(int)
+3591,append-index-k with k=5,"([11, 9, 15, 7, 2, 3, 11, 7, 1, 2],)","[11, 9, 15, 7, 2, 3, 11, 7, 1, 2, 2]",list(int) -> list(int)
+3592,remove-index-k with k=1,"([2, 8, 12],)","[8, 12]",list(int) -> list(int)
+3593,append-index-k with k=3,"([0, 13, 12, 12],)","[0, 13, 12, 12, 12]",list(int) -> list(int)
+3594,has-k with k=2,"([2, 2, 2, 2, 2],)",True,list(int) -> bool
+3595,bool-identify-is-mod-k with k=3,"([3, 3, 7, 3, 14],)","[True, True, False, True, False]",list(int) -> list(bool)
+3596,caesar-cipher-k-modulo-n with k=5 and n=2,"([1, 0, 1, 1],)","[0, 1, 0, 0]",list(int) -> list(int)
+3597,slice-k-n with k=5 and n=5,"([12, 15, 3, 13, 4, 13, 4, 11, 8, 1, 3, 9, 13, 13],)","[4, 13, 4, 11, 8]",list(int) -> list(int)
+3598,prepend-k with k=3,"([],)",[3],list(int) -> list(int)
+3599,has-k with k=2,"([2, 3, 6, 6, 7, 7],)",True,list(int) -> bool
+3600,slice-k-n with k=4 and n=4,"([6, 4, 5, 10, 15, 4, 6, 16, 15, 15, 12],)","[10, 15, 4, 6]",list(int) -> list(int)
+3601,remove-mod-k with k=5,"([9, 13, 0, 8],)","[9, 13, 8]",list(int) -> list(int)
+3602,append-index-k with k=1,"([13, 14, 9, 10, 15, 3, 9, 15],)","[13, 14, 9, 10, 15, 3, 9, 15, 13]",list(int) -> list(int)
+3603,rotate-k with k=4,"([8, 0, 13, 13, 1, 8, 8, 4, 5],)","[8, 8, 4, 5, 8, 0, 13, 13, 1]",list(int) -> list(int)
+3604,bool-identify-geq-k with k=1,"([4, 15, 1, 15, 13, 10],)","[True, True, True, True, True, True]",list(int) -> list(bool)
+3605,take-k with k=1,"([6, 7, 12, 16],)",[6],list(int) -> list(int)
+3606,repeat-k with k=4,"([12, 14, 1],)","[12, 14, 1, 12, 14, 1, 12, 14, 1, 12, 14, 1]",list(int) -> list(int)
+3607,caesar-cipher-k-modulo-n with k=3 and n=2,"([1, 1, 0, 0],)","[0, 0, 1, 1]",list(int) -> list(int)
+3608,keep squares,"([9, 8, 4, 8, 16, 16, 16],)","[9, 4, 16, 16, 16]",list(int) -> list(int)
+3609,slice-k-n with k=5 and n=4,"([8, 1, 8, 16, 7, 10, 9, 3, 9, 9, 10, 3, 15, 16, 5, 5],)","[7, 10, 9, 3]",list(int) -> list(int)
+3610,index-k with k=4,"([9, 13, 4, 8, 10, 3],)",8,list(int) -> int
+3611,tail,"([9, 5, 7, 5, 4, 1],)","[5, 7, 5, 4, 1]",list(int) -> list(int)
+3612,prepend-k with k=0,"([14, 0, 3],)","[0, 14, 0, 3]",list(int) -> list(int)
+3613,repeat-k with k=2,"([],)",[],list(int) -> list(int)
+3614,slice-k-n with k=2 and n=3,"([5, 11, 2, 6, 5, 15, 7, 0, 10, 16],)","[11, 2, 6]",list(int) -> list(int)
+3615,pow-k with k=3,"([],)",[],list(int) -> list(int)
+3616,keep gt 0,"([5, 4, 1, 5, 1],)","[5, 4, 1, 5, 1]",list(int) -> list(int)
+3617,+1 maximum list,"([3, 5, 0],)",6,list(int) -> int
+3618,slice-k-n with k=5 and n=3,"([13, 7, 0, 10, 10, 10, 15, 11, 14, 4, 16, 5],)","[10, 10, 15]",list(int) -> list(int)
+3619,slice-k-n with k=2 and n=5,"([14, 6, 8, 15, 15, 14, 12, 3],)","[6, 8, 15, 15, 14]",list(int) -> list(int)
+3620,keep gt 3,"([6, 1, 1, 3, 1],)",[6],list(int) -> list(int)
+3621,prepend-index-k with k=3,"([15, 12, 9, 14, 7, 9],)","[9, 15, 12, 9, 14, 7, 9]",list(int) -> list(int)
+3622,slice-k-n with k=3 and n=3,"([7, 13, 9, 7, 8, 15, 9, 15, 7, 4, 9],)","[9, 7, 8]",list(int) -> list(int)
+3623,is-mod-k with k=4,"([0, 7, 13, 8, 10],)",False,list(int) -> bool
+3624,rotate-k with k=4,"([7, 7, 2, 1, 10, 7, 2, 4, 3, 4, 10, 3, 12, 0, 15, 14],)","[12, 0, 15, 14, 7, 7, 2, 1, 10, 7, 2, 4, 3, 4, 10, 3]",list(int) -> list(int)
+3625,bool-identify-k with k=5,"([5, 5, 2, 5, 5, 5],)","[True, True, False, True, True, True]",list(int) -> list(bool)
+3626,replace-all-with-index-k with k=5,"([12, 3, 6, 14, 5],)","[5, 5, 5, 5, 5]",list(int) -> list(int)
+3627,remove-mod-k with k=3,"([4, 15, 1, 6],)","[4, 1]",list(int) -> list(int)
+3628,slice-k-n with k=4 and n=4,"([2, 0, 10, 7, 5, 12, 15, 2, 11, 11, 7, 3, 8, 2],)","[7, 5, 12, 15]",list(int) -> list(int)
+3629,append-index-k with k=3,"([6, 15, 6, 15, 5, 13],)","[6, 15, 6, 15, 5, 13, 6]",list(int) -> list(int)
+3630,bool-identify-is-mod-k with k=2,"([0, 13, 2],)","[True, False, True]",list(int) -> list(bool)
+3631,caesar-cipher-k-modulo-n with k=3 and n=4,"([3, 0, 3, 3, 3],)","[2, 3, 2, 2, 2]",list(int) -> list(int)
+3632,replace-all-with-index-k with k=1,"([10, 8, 1, 12],)","[10, 10, 10, 10]",list(int) -> list(int)
+3633,evens,"([12, 13],)",[12],list(int) -> list(int)
+3634,add-k with k=2,"([9, 4, 9, 6],)","[11, 6, 11, 8]",list(int) -> list(int)
+3635,rotate-k with k=1,"([10, 5, 9, 13, 4, 8, 10, 3, 2, 12, 9, 0],)","[0, 10, 5, 9, 13, 4, 8, 10, 3, 2, 12, 9]",list(int) -> list(int)
+3636,remove eq 2,"([0, 2, 2, 5, 1],)","[0, 5, 1]",list(int) -> list(int)
+3637,slice-k-n with k=2 and n=4,"([16, 6, 12, 6, 8, 11, 7, 2, 11, 2, 4, 1],)","[6, 12, 6, 8]",list(int) -> list(int)
+3638,slice-k-n with k=1 and n=3,"([15, 12, 15, 9, 8, 3, 14, 3, 0, 0, 14],)","[15, 12, 15]",list(int) -> list(int)
+3639,is-evens,"([14, 6, 5],)",False,list(int) -> bool
+3640,append-index-k with k=5,"([12, 12, 3, 2, 14, 15, 10, 11, 4, 11, 15, 2],)","[12, 12, 3, 2, 14, 15, 10, 11, 4, 11, 15, 2, 14]",list(int) -> list(int)
+3641,bool-identify-is-mod-k with k=5,"([],)",[],list(int) -> list(bool)
+3642,repeat-k with k=5,"([1, 3, 9, 11, 15],)","[1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15, 1, 3, 9, 11, 15]",list(int) -> list(int)
+3643,len,"([7, 14, 11],)",3,list(int) -> int
+3644,remove-mod-k with k=2,"([7, 10],)",[7],list(int) -> list(int)
+3645,keep-mod-head,"([12, 3],)",[],list(int) -> list(int)
+3646,caesar-cipher-k-modulo-n with k=2 and n=3,"([],)",[],list(int) -> list(int)
+3647,slice-k-n with k=2 and n=2,"([11, 7, 5, 13, 0, 4, 14, 8, 3, 10],)","[7, 5]",list(int) -> list(int)
+3648,append-k with k=2,"([14, 12, 13, 12, 1],)","[14, 12, 13, 12, 1, 2]",list(int) -> list(int)
+3649,slice-k-n with k=3 and n=5,"([5, 0, 14, 1, 3, 6, 0, 6, 16, 3, 2, 14, 8, 7, 8, 16],)","[14, 1, 3, 6, 0]",list(int) -> list(int)
+3650,index-k with k=3,"([16, 1, 14],)",14,list(int) -> int
+3651,repeat,"([1, 2],)",[2],list(int) -> list(int)
+3652,prepend-k with k=1,"([],)",[1],list(int) -> list(int)
+3653,replace-all-with-index-k with k=2,"([9, 8],)","[8, 8]",list(int) -> list(int)
+3654,kth-largest with k=3,"([11, 12, 13, 4, 0, 13, 6, 9, 1, 9],)",12,list(int) -> int
+3655,append-index-k with k=3,"([6, 14, 12, 4, 4, 15, 3, 1, 4],)","[6, 14, 12, 4, 4, 15, 3, 1, 4, 12]",list(int) -> list(int)
+3656,slice-k-n with k=5 and n=1,"([13, 2, 13, 7, 6, 6, 14, 5, 15, 5, 16],)",[6],list(int) -> list(int)
+3657,prepend-index-k with k=5,"([7, 5, 5, 10, 11, 7, 2, 2, 2, 10, 2, 0],)","[11, 7, 5, 5, 10, 11, 7, 2, 2, 2, 10, 2, 0]",list(int) -> list(int)
+3658,remove gt 0,"([4, 3, 4, 1, 3],)",[],list(int) -> list(int)
+3659,repeat-k with k=5,"([],)",[],list(int) -> list(int)
+3660,modulo-k with k=3,"([12, 4, 8, 11, 0, 8, 11],)","[0, 1, 2, 2, 0, 2, 2]",list(int) -> list(int)
+3661,count-k with k=0,"([0, 7],)",1,list(int) -> int
+3662,caesar-cipher-k-modulo-n with k=2 and n=3,"([2, 2, 2, 1],)","[1, 1, 1, 0]",list(int) -> list(int)
+3663,bool-identify-is-mod-k with k=1,"([1, 1, 1],)","[True, True, True]",list(int) -> list(bool)
+3664,append-k with k=2,"([],)",[2],list(int) -> list(int)
+3665,slice-k-n with k=1 and n=4,"([5, 6, 8, 1, 11, 12, 12, 6, 5, 6],)","[5, 6, 8, 1]",list(int) -> list(int)
+3666,mult-k with k=5,"([3, 9, 12, 12, 4, 12],)","[15, 45, 60, 60, 20, 60]",list(int) -> list(int)
+3667,count-head-in-tail,"([2, 3, 4],)",0,list(int) -> int
+3668,pop,"([2, 0, 1, 11, 11, 10],)","[2, 0, 1, 11, 11]",list(int) -> list(int)
+3669,is-odds,"([12],)",False,list(int) -> bool
+3670,pop,"([0],)",[],list(int) -> list(int)
+3671,has-k with k=5,"([2, 13],)",False,list(int) -> bool
+3672,caesar-cipher-k-modulo-n with k=1 and n=5,"([2, 3, 3],)","[3, 4, 4]",list(int) -> list(int)
+3673,caesar-cipher-k-modulo-n with k=3 and n=2,"([0, 0, 0, 0, 1, 1],)","[1, 1, 1, 1, 0, 0]",list(int) -> list(int)
+3674,slice-k-n with k=4 and n=2,"([12, 9, 10, 1, 7, 7, 10, 7, 4, 1, 2, 12, 9, 14],)","[1, 7]",list(int) -> list(int)
+3675,slice-k-n with k=4 and n=5,"([7, 8, 2, 2, 13, 15, 0, 9, 8, 8, 13, 13, 10, 11, 7],)","[2, 13, 15, 0, 9]",list(int) -> list(int)
+3676,kth-largest with k=1,"([16],)",16,list(int) -> int
+3677,slice-k-n with k=3 and n=1,"([12, 5, 11, 0, 2, 6, 2, 10, 16],)",[11],list(int) -> list(int)
+3678,caesar-cipher-k-modulo-n with k=1 and n=2,"([],)",[],list(int) -> list(int)
+3679,remove-mod-k with k=3,"([6],)",[],list(int) -> list(int)
+3680,keep-mod-k with k=2,"([10, 8, 16, 5, 9],)","[10, 8, 16]",list(int) -> list(int)
+3681,caesar-cipher-k-modulo-n with k=2 and n=3,"([0, 0, 0, 2, 2],)","[2, 2, 2, 1, 1]",list(int) -> list(int)
+3682,caesar-cipher-k-modulo-n with k=4 and n=3,"([2, 2, 1, 1, 2, 1, 0],)","[0, 0, 2, 2, 0, 2, 1]",list(int) -> list(int)
+3683,odds,"([2, 5, 4, 2, 0, 5, 1, 1],)","[5, 5, 1, 1]",list(int) -> list(int)
+3684,is-primes,"([5],)",True,list(int) -> bool
+3685,bool-identify-is-mod-k with k=4,"([2, 4],)","[False, True]",list(int) -> list(bool)
+3686,index-k with k=1,"([0, 3, 1, 6],)",0,list(int) -> int
+3687,keep-mod-k with k=3,"([5, 16, 12],)",[12],list(int) -> list(int)
+3688,replace-all-with-index-k with k=4,"([1, 4, 13, 3],)","[3, 3, 3, 3]",list(int) -> list(int)
+3689,append-index-k with k=4,"([9, 14, 6, 9, 8, 2, 5, 13, 3, 7],)","[9, 14, 6, 9, 8, 2, 5, 13, 3, 7, 9]",list(int) -> list(int)
+3690,add-k with k=1,"([15, 2, 16, 2, 5, 15, 6],)","[16, 3, 17, 3, 6, 16, 7]",list(int) -> list(int)
+3691,slice-k-n with k=4 and n=3,"([14, 8, 11, 16, 15, 11, 5, 5, 10, 0, 12, 8, 3, 9],)","[16, 15, 11]",list(int) -> list(int)
+3692,append-index-k with k=3,"([15, 0, 13, 10, 7, 1, 14, 5, 10, 10],)","[15, 0, 13, 10, 7, 1, 14, 5, 10, 10, 13]",list(int) -> list(int)
+3693,count-k with k=3,"([10, 0, 15, 9, 13],)",0,list(int) -> int
+3694,slice-k-n with k=4 and n=4,"([14, 9, 3, 15, 10, 9, 5, 12, 14, 4, 7, 13, 15, 2],)","[15, 10, 9, 5]",list(int) -> list(int)
+3695,append-index-k with k=4,"([5, 2, 13, 3, 0, 8],)","[5, 2, 13, 3, 0, 8, 3]",list(int) -> list(int)
+3696,is-mod-k with k=5,"([60, 25, 45, 25, 25],)",True,list(int) -> bool
+3697,add-k with k=3,"([2, 4, 6, 9, 13],)","[5, 7, 9, 12, 16]",list(int) -> list(int)
+3698,remove gt 2,"([4, 3, 0, 1, 3],)","[0, 1]",list(int) -> list(int)
+3699,bool-identify-is-mod-k with k=3,"([3, 16, 11, 3],)","[True, False, False, True]",list(int) -> list(bool)
+3700,keep-mod-k with k=3,"([],)",[],list(int) -> list(int)
+3701,take-k with k=5,"([1, 10, 9, 6, 10, 14, 7, 11, 16, 15],)","[1, 10, 9, 6, 10]",list(int) -> list(int)
+3702,remove-index-k with k=3,"([11, 7, 2],)","[11, 7]",list(int) -> list(int)
+3703,keep-mod-head,"([1, 2, 3],)","[2, 3]",list(int) -> list(int)
+3704,keep gt 0,"([0, 3, 5, 0, 0],)","[3, 5]",list(int) -> list(int)
+3705,mult-k with k=0,"([11, 11, 4, 14, 6, 14, 0],)","[0, 0, 0, 0, 0, 0, 0]",list(int) -> list(int)
+3706,slice-k-n with k=3 and n=4,"([9, 8, 16, 9, 14, 9, 12, 1, 1, 0, 13, 0],)","[16, 9, 14, 9]",list(int) -> list(int)
+3707,slice-k-n with k=2 and n=1,"([7, 13, 3, 4, 8, 16, 5, 1],)",[13],list(int) -> list(int)
+3708,caesar-cipher-k-modulo-n with k=3 and n=2,"([0, 0, 0, 0, 1, 0, 1],)","[1, 1, 1, 1, 0, 1, 0]",list(int) -> list(int)
+3709,reverse,"([2, 0, 4],)","[4, 0, 2]",list(int) -> list(int)
+3710,has-k with k=1,"([14, 8, 1, 1, 1, 1],)",True,list(int) -> bool
+3711,append-k with k=1,"([9],)","[9, 1]",list(int) -> list(int)
+3712,remove eq 3,"([4, 5, 2, 5, 6],)","[4, 5, 2, 5, 6]",list(int) -> list(int)
+3713,kth-smallest with k=2,"([7, 2, 5, 9, 11, 13, 2],)",2,list(int) -> int
+3714,bool-identify-geq-k with k=1,"([1, 5, 1, 5, 6],)","[True, True, True, True, True]",list(int) -> list(bool)
+3715,is-evens,"([4, 13, 12, 8, 14, 1, 7],)",False,list(int) -> bool
+3716,modulo-k with k=2,"([5, 16, 10, 16, 8, 7],)","[1, 0, 0, 0, 0, 1]",list(int) -> list(int)
+3717,odds,"([6, 10, 15, 8, 14, 3],)","[15, 3]",list(int) -> list(int)
+3718,has-k with k=0,"([1, 8],)",False,list(int) -> bool
+3719,modulo-k with k=3,"([],)",[],list(int) -> list(int)
+3720,slice-k-n with k=2 and n=1,"([16, 1, 14, 11, 16, 4],)",[1],list(int) -> list(int)
+3721,prepend-index-k with k=5,"([3, 9, 3, 9, 3, 11],)","[3, 3, 9, 3, 9, 3, 11]",list(int) -> list(int)
+3722,repeat-k with k=2,"([9, 5, 0, 0, 13],)","[9, 5, 0, 0, 13, 9, 5, 0, 0, 13]",list(int) -> list(int)
+3723,odds,"([],)",[],list(int) -> list(int)
+3724,slice-k-n with k=1 and n=1,"([8, 5, 0],)",[8],list(int) -> list(int)
+3725,replace-all-with-index-k with k=5,"([2, 4, 9, 8, 7, 9, 16],)","[7, 7, 7, 7, 7, 7, 7]",list(int) -> list(int)
+3726,prepend-k with k=4,"([12, 7],)","[4, 12, 7]",list(int) -> list(int)
+3727,keep-mod-k with k=4,"([16],)",[16],list(int) -> list(int)
+3728,is-mod-k with k=4,"([16, 15, 11, 9, 16],)",False,list(int) -> bool
+3729,slice-k-n with k=5 and n=1,"([8, 3, 7, 9, 3, 8, 10, 9],)",[3],list(int) -> list(int)
+3730,slice-k-n with k=1 and n=4,"([15, 13, 11, 10, 5, 14, 11, 13, 6, 5],)","[15, 13, 11, 10]",list(int) -> list(int)
+3731,index-k with k=5,"([0, 15, 1, 4, 12, 10, 8, 7, 4, 2, 3, 12],)",12,list(int) -> int
+3732,take-k with k=3,"([7, 4, 16, 15, 16, 3, 10, 11, 3],)","[7, 4, 16]",list(int) -> list(int)
+3733,sort-and-deduplicate,"([3, 7, 5, 4],)","[3, 4, 5, 7]",list(int) -> list(int)
+3734,remove gt 3,"([1, 2, 0, 0, 6],)","[1, 2, 0, 0]",list(int) -> list(int)
+3735,bool-identify-k with k=4,"([13, 4, 0, 1, 4],)","[False, True, False, False, True]",list(int) -> list(bool)
+3736,append-index-k with k=5,"([16, 15, 7, 8, 2, 5, 14, 15, 8, 8],)","[16, 15, 7, 8, 2, 5, 14, 15, 8, 8, 2]",list(int) -> list(int)
+3737,remove gt 1,"([5, 0, 1, 6, 0],)","[0, 1, 0]",list(int) -> list(int)
+3738,append-index-k with k=5,"([13, 0, 16, 8, 9, 10, 16, 7],)","[13, 0, 16, 8, 9, 10, 16, 7, 9]",list(int) -> list(int)
+3739,slice-k-n with k=5 and n=5,"([8, 0, 5, 2, 1, 6, 13, 16, 14, 6, 13, 16, 6],)","[1, 6, 13, 16, 14]",list(int) -> list(int)
+3740,slice-k-n with k=5 and n=5,"([13, 11, 2, 2, 14, 5, 13, 9, 10, 2, 11],)","[14, 5, 13, 9, 10]",list(int) -> list(int)
+3741,product,"([8, 6, 8, 11, 11, 16],)",743424,list(int) -> int
+3742,range,"(3,)","[0, 1, 2]",int -> list(int)
+3743,rotate-k with k=2,"([2, 7, 8, 16, 10, 0, 10, 8, 9, 8, 1, 9, 3],)","[9, 3, 2, 7, 8, 16, 10, 0, 10, 8, 9, 8, 1]",list(int) -> list(int)
+3744,max,"([13, 10, 9, 16, 4, 15, 13],)",16,list(int) -> int
+3745,range,"(2,)","[0, 1]",int -> list(int)
+3746,bool-identify-geq-k with k=2,"([1, 3, 4, 1, 13, 9],)","[False, True, True, False, True, True]",list(int) -> list(bool)
+3747,remove-index-k with k=1,"([1],)",[],list(int) -> list(int)
+3748,range,"(1,)",[0],int -> list(int)
+3749,keep-mod-head,"([6, 6, 5, 24, 54, 24],)","[6, 24, 54, 24]",list(int) -> list(int)
+3750,index-k with k=3,"([8, 2, 15, 3, 10, 0],)",15,list(int) -> int
+3751,sum,"([10],)",10,list(int) -> int
+3752,keep-mod-k with k=2,"([10, 0, 16],)","[10, 0, 16]",list(int) -> list(int)
+3753,remove-mod-k with k=4,"([28, 6, 20, 16, 5],)","[6, 5]",list(int) -> list(int)
+3754,bool-identify-geq-k with k=0,"([10, 6, 8, 4, 6, 6, 7],)","[True, True, True, True, True, True, True]",list(int) -> list(bool)
+3755,pow-k with k=4,"([0, 2, 5, 4, 11, 7],)","[0, 16, 625, 256, 14641, 2401]",list(int) -> list(int)
+3756,pop,"([2],)",[],list(int) -> list(int)
+3757,caesar-cipher-k-modulo-n with k=1 and n=2,"([0, 1, 0],)","[1, 0, 1]",list(int) -> list(int)
+3758,add-k with k=5,"([7, 6, 11],)","[12, 11, 16]",list(int) -> list(int)
+3759,empty,"([],)",True,list(int) -> bool
+3760,slice-k-n with k=3 and n=1,"([5, 9, 2, 16, 15, 0, 5, 10, 3],)",[2],list(int) -> list(int)
+3761,mult-k with k=5,"([8, 15, 9, 0, 1],)","[40, 75, 45, 0, 5]",list(int) -> list(int)
+3762,slice-k-n with k=2 and n=1,"([2, 6, 5, 5, 2],)",[6],list(int) -> list(int)
+3763,kth-largest with k=4,"([14, 4, 4, 13, 12],)",4,list(int) -> int
+3764,replace-all-with-index-k with k=4,"([10, 5, 4, 3, 7, 1, 5, 10, 3, 15],)","[3, 3, 3, 3, 3, 3, 3, 3, 3, 3]",list(int) -> list(int)
+3765,index-k with k=2,"([10, 10, 6, 8, 1, 3, 0],)",10,list(int) -> int
+3766,add-k with k=1,"([9, 6],)","[10, 7]",list(int) -> list(int)
+3767,index-k with k=1,"([6, 1, 4, 12, 12, 0],)",6,list(int) -> int
+3768,caesar-cipher-k-modulo-n with k=2 and n=5,"([],)",[],list(int) -> list(int)
+3769,index-k with k=4,"([5, 11, 2, 10, 13, 9, 13, 16],)",10,list(int) -> int
+3770,has-k with k=0,"([3, 8, 9],)",False,list(int) -> bool
+3771,slice-k-n with k=5 and n=3,"([14, 15, 15, 9, 3, 7, 7, 6, 8, 1, 1, 7, 9],)","[3, 7, 7]",list(int) -> list(int)
+3772,is-primes,"([17, 193, 149, 13, 3, 47],)",True,list(int) -> bool
+3773,keep-mod-k with k=2,"([12],)",[12],list(int) -> list(int)
+3774,slice-k-n with k=2 and n=1,"([15, 2, 4, 4, 4, 9],)",[2],list(int) -> list(int)
+3775,prepend-k with k=2,"([13, 1, 0],)","[2, 13, 1, 0]",list(int) -> list(int)
+3776,bool-identify-k with k=1,"([3, 3, 5, 1, 13],)","[False, False, False, True, False]",list(int) -> list(bool)
+3777,drop-k with k=1,"([4, 7, 11, 4, 2, 5, 13, 5],)","[7, 11, 4, 2, 5, 13, 5]",list(int) -> list(int)
+3778,remove-index-k with k=4,"([12, 9, 10, 2, 3, 5, 1, 8],)","[12, 9, 10, 3, 5, 1, 8]",list(int) -> list(int)
+3779,max,"([3],)",3,list(int) -> int
+3780,kth-largest with k=2,"([8, 13, 5, 2],)",8,list(int) -> int
+3781,remove-index-k with k=5,"([8, 10, 8, 4, 16, 7, 10, 5, 13],)","[8, 10, 8, 4, 7, 10, 5, 13]",list(int) -> list(int)