diff --git a/Backgrounds/brick_wall_and_stairs.jpg b/Backgrounds/brick-wall-and-stairs.jpg
similarity index 100%
rename from Backgrounds/brick_wall_and_stairs.jpg
rename to Backgrounds/brick-wall-and-stairs.jpg
diff --git a/Costumes/Alonzo3D.png b/Costumes/Alonzo3D.png
new file mode 100644
index 00000000..09b95410
Binary files /dev/null and b/Costumes/Alonzo3D.png differ
diff --git a/Costumes/COSTUMES b/Costumes/COSTUMES
index 9184909d..8a7f63cc 100644
--- a/Costumes/COSTUMES
+++ b/Costumes/COSTUMES
@@ -4,7 +4,8 @@ abby-c.svg abby c
abby-d.svg abby d
airplane2.png airplane2
alonzo.png alonzo
-Alonzo3D.png alonzo3D
+Alonzo3D.png alonzo (3D)
+alonzo.svg alonzo (vector)
amon.gif amon
anina_pop_down.png anina pop down
anina_pop_front.png anina pop front
diff --git a/Costumes/alonzo.svg b/Costumes/alonzo.svg
new file mode 100644
index 00000000..e9c00982
--- /dev/null
+++ b/Costumes/alonzo.svg
@@ -0,0 +1,55 @@
+
+
+
+
diff --git a/libraries/list-utilities.xml b/libraries/list-utilities.xml
index e49f0458..06eb9e11 100644
--- a/libraries/list-utilities.xml
+++ b/libraries/list-utilities.xml
@@ -1 +1 @@
-Take any number of input lists, and create a new list containing the items of the input lists. So
APPEND [A B] [C D]
where the [,,,] are lists reports the list
[A B C D]
not [[A B] [C D]].11111Reports a new list containing the items of the input list, but in the opposite order.1inputresultReports a new list whose items are the same as in the input list, except that if two or more equal items appear in the input list, only the last one is kept in the result.1Reports a sorted version of the list in its first input slot, using the comparison function in the second input slot. For a list of numbers, using < as the comparison function will sort from low to high; using > will sort from high to low.1even itemsmerge11#1#2The second input is an "association list," a list of two-item lists. Each of those smaller lists has a "key" as its first item and a "value" as its second. ASSOC reports the first key-value pair in the association list whose key matches the first input.11
\ No newline at end of file
+Take any number of input lists, and create a new list containing the items of the input lists. So
APPEND [A B] [C D]
where the [,,,] are lists reports the list
[A B C D]
not [[A B] [C D]].11111Reports a new list containing the items of the input list, but in the opposite order.1inputresultReports a new list whose items are the same as in the input list, except that if two or more equal items appear in the input list, only the last one is kept in the result.1Reports a sorted version of the list in its first input slot, using the comparison function in the second input slot. For a list of numbers, using < as the comparison function will sort from low to high; using > will sort from high to low.1even itemsmerge11#1#2The second input is an "association list," a list of two-item lists. Each of those smaller lists has a "key" as its first item and a "value" as its second. ASSOC reports the first key-value pair in the association list whose key matches the first input.11#11datacountmapmany##1#1data listscount#1datacount1
\ No newline at end of file