diff --git a/kirj.tex b/kirj.tex
index 7cf1e9b..26997b4 100644
--- a/kirj.tex
+++ b/kirj.tex
@@ -5,6 +5,16 @@
   \emph{Data Structures and Algorithms},
   Addison-Wesley, 1983.
 
+\bibitem{ahu91}
+  R. K. Ahuja and J. B. Orlin.
+  Distance directed augmenting path algorithms for maximum flow and parametric maximum flow problems.
+  \emph{Naval Research Logistics}, 38(3):413--430, 1991.
+
+\bibitem{and79}
+  A. M. Andrew.
+  Another efficient algorithm for convex hulls in two dimensions.
+  \emph{Information Processing Letters}, 9(5):216--219, 1979.
+
 \bibitem{asp79}
   B. Aspvall, M. F. Plass and R. E. Tarjan.
   A linear-time algorithm for testing the truth of certain quantified boolean formulas.
@@ -15,6 +25,11 @@
   On a routing problem.
   \emph{Quarterly of Applied Mathematics}, 16(1):87--90, 1958.
 
+\bibitem{ben00}
+  M. A. Bender and M. Farach-Colton.
+  The LCA problem revisited. In
+  \emph{Latin American Symposium on Theoretical Informatics}, 88--94, 2000.
+
 \bibitem{ben86}
   J. Bentley.
   \emph{Programming Pearls}.
@@ -101,6 +116,22 @@
   A method for the construction of minimum-redundancy codes.
   \emph{Proceedings of the IRE}, 40(9):1098--1101, 1952.
 
+\bibitem{icpc}
+  The ACM-ICPC International Collegiate Programming Contest,
+  \url{https://icpc.baylor.edu/}
+
+\bibitem{ioi}
+  International Olympiad in Informatics -- Official site,
+  \url{http://www.ioinformatics.org/}
+
+\bibitem{iois}
+  International Olympiad in Informatics -- Statistics,
+  \url{http://stats.ioinformatics.org/}
+
+\bibitem{ioiy}
+  MisoF's IOI Syllabus page,
+  \url{https://people.ksp.sk/~misof/ioi-syllabus/}
+
 \bibitem{kar87}
   R. M. Karp and M. O. Rabin.
   Efficient randomized pattern-matching algorithms.
@@ -121,16 +152,14 @@
   On the shortest spanning subtree of a graph and the traveling salesman problem.
   \emph{Proceedings of the American Mathematical Society}, 7(1):48--50, 1956.
 
-\bibitem{ben00}
-  M. A. Bender and M. Farach-Colton.
-  The LCA problem revisited. In
-  \emph{Latin American Symposium on Theoretical Informatics}, 88--94, 2000.
-
 \bibitem{mai84}
   M. G. Main and R. J. Lorentz.
   An $O(n \log n)$ algorithm for finding all repetitions in a string.
   \emph{Journal of Algorithms}, 5(3):422--432, 1984.
 
+\bibitem{main}
+  Młodzieżowa Akademia Informatyczna (MAIN),
+  \url{http://main.edu.pl/en}
 
 \bibitem{pac13}
   J. Pachocki and J. Radoszweski.
diff --git a/kkkk.pdf b/kkkk.pdf
index 4c21c12..323f47e 100644
Binary files a/kkkk.pdf and b/kkkk.pdf differ
diff --git a/kkkk.tex b/kkkk.tex
index f0aaaca..bdca2b8 100644
--- a/kkkk.tex
+++ b/kkkk.tex
@@ -1,6 +1,6 @@
 \documentclass[twoside,12pt,a4paper,english]{book}
 
-\includeonly{luku18,kirj}
+%\includeonly{luku01,kirj}
 
 \usepackage[english]{babel}
 \usepackage[utf8]{inputenc}