hello hallo hullo this is a new and improved version™ of the old project (https://scratch.mit.edu/projects/1385334194) which i see wasn't coded as well. as far as i know, that one went up to the 20th sublist without lag and this goes to around the 30th without much lag (when writing)
removed stuff like the "store indexes" variable and handled some stuff using the main list as memory instead. also, for each loops are used in place of some repeat untils for simplicity (not for style). the code is also probably easier to understand (at least in my opinion) p.s. why was there a refresh current list block in v1.
