diff --git a/chapter02/worksheets/solution2.1.7.10.scala b/chapter02/worksheets/solution2.1.7.10.scala
index 93c1256..cdc085b 100644
--- a/chapter02/worksheets/solution2.1.7.10.scala
+++ b/chapter02/worksheets/solution2.1.7.10.scala
@@ -2,7 +2,7 @@
 
 /** 
   Exercise 2.1.7.10
-  Given a Seq[List[Int]], compute a new Seq[List[Int]] where each list contains three largest elements from the initial list (or fewer than three if the initial inner list is
+  Given a Seq[List[Int]], compute a new Seq[List[Int]] where each list contains three largest elements from the initial list (or fewer than three if the initial list is
   shorter). So, for the input:
 
   Seq(List(0, 50, 5, 10, 30), List(100), List(1, 2, 200, 20))