If it were a list of nine items, it would look like the last picture in your post. What you really have is a list of two items, one of which is a list, i.e., you have a list of lists, a two-dimensional list. So, if you look at the first picture in your post, it has two rows. If we move our focus to the array with one million items, we can better understand the impact of choosing one approach instead of the other.
If no spells are included in the prerequisites, use the following default guidelines. When Gourmand is exhausted, Spears have reduced velocity, a curved throw trajectory, and deal only 0.3 damage. Gourmand can roll for a significantly longer time than other Slugcats, making it another good option for traversing flat areas.
Now all you need to do is randomly sort your list of items and ARRAY_CONSTRAIN will return a sample of however many you need. If it does contain blanks the items at the end of your list will not be able to be randomly selected as blanks aren't counted by COUNTA. The Fisher-Yates Shuffle Algorithm, also known as the Knuth Shuffle is a method for randomly shuffling elements in an array.
Using this tool will open a new window in your mind, which will definitely be helpful for various projects and games. It’s okay if sometimes you run out of ideas