diff --git a/programs/demos/kmatrix/trunk/COPYING b/programs/demos/kmatrix/trunk/COPYING
new file mode 100755
index 0000000000..f288702d2f
--- /dev/null
+++ b/programs/demos/kmatrix/trunk/COPYING
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
diff --git a/programs/demos/kmatrix/trunk/Tupfile.lua b/programs/demos/kmatrix/trunk/Tupfile.lua
new file mode 100755
index 0000000000..e552d22b33
--- /dev/null
+++ b/programs/demos/kmatrix/trunk/Tupfile.lua
@@ -0,0 +1,10 @@
+if tup.getconfig("NO_TCC") ~= "" then return end
+
+TCC="kos32-tcc"
+CFLAGS  = "-I../../../develop/ktcc/trunk/libc.obj/include"
+LDFLAGS = "-nostdlib ../../../develop/ktcc/trunk/bin/lib/crt0.o -L../../../develop/ktcc/trunk/bin/lib"
+LIBS = "-ltcc -lc.obj"
+
+COMMAND=string.format("%s %s %s %s %s", TCC, CFLAGS, LDFLAGS , "%f -o %o",  LIBS)
+
+tup.rule({"main.c"}, COMMAND .. tup.getconfig("KPACK_CMD"), "kmatrix")
\ No newline at end of file
diff --git a/programs/demos/kmatrix/trunk/build_kolibrios.sh b/programs/demos/kmatrix/trunk/build_kolibrios.sh
new file mode 100755
index 0000000000..6a84c1a566
--- /dev/null
+++ b/programs/demos/kmatrix/trunk/build_kolibrios.sh
@@ -0,0 +1,3 @@
+#SHS
+/kolibrios/develop/tcc/tcc main.c -o KMatrix.kex -ltcc -lc.obj
+exit
\ No newline at end of file
diff --git a/programs/demos/kmatrix/trunk/main.c b/programs/demos/kmatrix/trunk/main.c
new file mode 100755
index 0000000000..4016674f82
--- /dev/null
+++ b/programs/demos/kmatrix/trunk/main.c
@@ -0,0 +1,862 @@
+/*
+
+    KMatrix: Simulates moving matrix like in famous film.
+    Copyright (C) 2021-2022  Vitaliy Krylov
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h> // Especially for memcpy()
+#include <conio.h>
+#include <sys/ksys.h>
+
+#define bool unsigned char
+#define true 1
+#define false 0
+#define nullptr 0
+#define dword unsigned int
+
+#define CONSOLE_WIDTH 80
+#define CONSOLE_HEIGHT 25
+
+enum BUTTONS {
+	BTN_QUIT = 1
+};
+
+#define SYSFN04_FONT_W 8
+#define SYSFN04_FONT_H 14
+
+static inline void _ksys_set_input_mode(char mode) {
+	asm_inline(
+		"int $0x40"
+		::"a"(66), "b"(1), "c"(mode)
+	);
+}
+
+// Slightly edited implementation from glibc
+unsigned int rand_r_seed = 0;
+int rand_r() {
+	unsigned int *seed = &rand_r_seed;
+	unsigned int next = *seed;
+	int result;
+
+	next *= 1103515245;
+	next += 12345;
+	result = (unsigned int) (next / 65536) % 2048;
+
+	next *= 1103515245;
+	next += 12345;
+	result <<= 10;
+	result ^= (unsigned int) (next / 65536) % 1024;
+
+	next *= 1103515245;
+	next += 12345;
+	result <<= 10;
+	result ^= (unsigned int) (next / 65536) % 1024;
+
+	*seed = next;
+
+	return result;
+}
+//
+
+//<locales>
+/*
+	STR - string;
+	ERR - error;
+	INST - instant (must be formatted;  mainly for alloc. errors when it's better not to use concat and e.g.);
+*/
+
+//all:
+const char STR_PROGRAM_NAME[] = "KMatrix";
+
+//en_US:
+const char STR_PROGRAM_MOTD[] = "Matrix for KolibriOS";
+const char STR_ERR_INST_CONCAT[] = "[KMatrix] concat(): No free RAM left, string corrupted.\n";
+const char STR_ERR_INST_WRITEERRORF[] = "[KMatrix] writeErrorF(): Allocation error... | ";
+const char STR_ERR_INST_QUEUE_QALLOCMAIN[] = "[KMatrix] Q_alloc(): Queue allocation failed.\n";
+const char STR_ERR_INST_QUEUE_QALLOCDATA[] = "[KMatrix] Q_alloc(): Queue.data allocation failed.\n";
+const char STR_ERR_INST_QUEUE_QPUSH[] = "[KMatrix] Q_push(): Data allocation failed.\n";
+const char STR_ERR_QUEUE_QPOP[] = "Q_pop(): Wrong use.";
+const char STR_ERR_QUEUE_QFRONT[] = "Q_front(): Wrong use.";
+const char STR_ERR_CONSOLEINIT[] = "Unable to initialize console.";
+const char STR_ERR_INST_MAIN_MROWALLOC[] = "[KMatrix] MatrixRow allocation error.\n";
+const char STR_ERR_INST_MAIN_MROWSECALLOC[] = "[KMatrix] MatrixRow->sequence allocation error.\n";
+const char STR_ERR_INST_MAIN_TCURALLOC[] = "[KMatrix] Failed to create transparent cursor.\n";
+const char STR_ERR_MAIN_TCURLOAD[] = "Failed to load transparent cursor.";
+const char STR_MSG_HELP_USAGE[] = "Usage: %s [OPTION]...\n";
+const char* STR_MSG_HELP[] = {
+	"Simulates moving matrix like in famous film.\n\n",
+
+	"\t-F, --foreground\t<COLOR>\tset color of letters;\n",
+	"\t\t\tavailable colors: black, red, green, brown,\n",
+	"\t\t\tblue, purple, turqoise, white\n",
+	"\t\t\tor (available only in graphic mode):\n",
+	"\t\t\t<R,G,B>   For example: '-F 255,0,255'\n",
+	"\t-B, --background\t<COLOR>\tset color of background;\n",
+	"\t\t\tavailable colors: black, red, green, brown,\n",
+	"\t\t\tblue, purple, turqoise, white\n",
+	"\t\t\tor (available only in graphic mode):\n",
+	"\t\t\t<R,G,B>   For example: '-B 255,0,255'\n",
+	"\t-H, --highlight\t<COLOR>\tset color of lead symbols;\n",
+	"\t\t\tavailable colors: black, red, green, brown,\n",
+	"\t\t\tblue, purple, turqoise, white\n",
+	"\t\t\tor (available only in graphic mode):\n",
+	"\t\t\t<R,G,B>   For example: '-H 255,0,255'\n",
+	"\t-S, --speed\t<VALUE>\tset speed of falling letters;\n",
+	"\t\t\tit must be an integer and be more than 0;\n",
+	"\t\t\tdetermines how many falls will be per second;\n",
+	"\t\t\tnotice: formula of waiting is floor(100 / speed),\n",
+	"\t\t\tit means that some speed values will give same looking\n",
+	"\t@ss\t\trun this program as screensaver (normally you willn't need it)\n",
+	"\t--ccopt\t\toptimize fg. color changing (will be faster but could be changed not fully)\n",
+	"\t--shell\t\trun this program in shell\n",
+	"\t--help\t\tdisplay this help and exit\n",
+	"\t--version\t\toutput version information and exit\n\n",
+
+	"If program launched in graphical mode, you can do this:\n",
+	"\t[1]-[8] for color changing\n",
+	"\t[~] -- switch what to change (FG/BG/HL)\n",
+	"\t[+]/[-] for speed changing (there is 5 modes)\n",
+	"\t[ESC] -- close this program\n\n",
+
+	"Defaults when nothing has overriden:\n",
+	"\t--foreground green\n",
+	"\t--background black\n",
+	"\t--highlight white\n",
+	"\t--speed 10\n"
+};
+const char* STR_MSG_VERSION[] = {
+	"KMatrix 1.2\n",
+	"Copyright (C) 2021-2022 Vitaliy Krylov\n",
+	"License GPLv3+: GNU GPL version 3 or later <https://gnu.org/licenses/gpl.html>.\n",
+	"This is free software: you are free to change and redistribute it.\n",
+	"This program comes with ABSOLUTELY NO WARRANTY.\n\n",
+
+	"It is in no way affiliated in any way with the movie \"The Matrix\", \"Warner Bros\" nor any of its affiliates in any way.\n\n",
+
+	"Written by Vitaliy Krylov.\n"
+};
+const char STR_MSG_NOARG[] = "%s: option '%s' requires an argument\n";
+const char STR_MSG_HELPADVICE[] = "Try '%s --help' for more information.\n";
+const char STR_MSG_INVARG_COLOR[] = "%s: invalid color: '%s'\n";
+const char STR_MSG_INVARG_SPEED[] = "%s: invalid speed: '%s'\n";
+const char STR_MSG_UNRARG[] = "%s: unrecognized option '%s'\n";
+const char STR_MSG_CON_RGB[] = "%s: it's not allowed to set RGB-color in console mode\n";
+const char STR_MSG_CON_SS[] = "%s: it's not allowed to run in @ss mode in console mode\n";
+//</locales>
+
+char* STR_PROGRAM_TITLENAME; // Init in main()
+const char ss_path[] = "/sys/@ss";
+
+// Normally could be output to stderr
+void writeError(const char* text) {
+	_ksys_debug_puts(text);
+}
+//Formatted error output
+void writeErrorF(const char* text) {
+	int t_size = strlen(STR_PROGRAM_NAME)+5+strlen(text); // = 1+strlen(STR_PROGRAM_NAME)+2+strlen(text)+1+1
+	char* t = malloc(t_size);
+	if (!t) {
+		_ksys_debug_puts(STR_ERR_INST_WRITEERRORF);
+		_ksys_debug_puts(text);
+		_ksys_debug_puts("\n");
+		return;
+	}
+	t[t_size-1] = '\0';
+	sprintf(t, "[%s] %s\n", STR_PROGRAM_NAME, text);
+	_ksys_debug_puts(t);
+	free(t);
+}
+
+// Do not forget to free it
+// If no RAM left, it will try to return "\0". If not, then 0...
+char* concat(const char* s1, const char* s2) {
+	const size_t len1 = strlen(s1);
+	const size_t len2 = strlen(s2);
+	char* res = (char*)malloc(len1 + len2 + 1);
+	if (!res) {
+		writeError(STR_ERR_INST_CONCAT);
+		res = (char*)malloc(1);
+		if (res) res[0] = '\0';
+	} else {
+		memcpy(res, s1, len1);
+		memcpy(res + len1, s2, len2 + 1);
+	}
+	return res;
+}
+
+//<Queue>
+typedef struct {
+	unsigned int queue_size;
+	unsigned int sizeoftype;
+	void* data;
+	unsigned int data_maxsize;
+	unsigned int data_begin;
+	unsigned int data_size;
+} Queue;
+
+//queue_size = 0 if want dynamic size choosing
+Queue* Q_alloc(unsigned int sizeoftype, unsigned int queue_size) {
+	Queue* this = (Queue*)malloc(sizeof(Queue));
+	if (!this) {
+		writeError(STR_ERR_INST_QUEUE_QALLOCMAIN);
+		return nullptr;
+	}
+	this->sizeoftype = sizeoftype;
+	this->data_begin = 0;
+	this->data_size = 0;
+	if (queue_size) this->queue_size = queue_size;
+	else this->queue_size = 0x8000 / sizeoftype;
+	this->data_maxsize = this->queue_size;
+	this->data = (void*)malloc(this->data_maxsize * sizeoftype);
+	if (!this->data) {
+		writeError(STR_ERR_INST_QUEUE_QALLOCDATA);
+		free(this);
+		return nullptr;
+	}
+	return this;
+}
+
+void Q_free(Queue* this) {
+	free(this->data);
+	free(this);
+}
+
+//$value -- it is a reference to what you want to add
+void Q_push(Queue* this, const void* value) {
+	if (this->data_size == this->data_maxsize) {
+		void* olddata = this->data;
+		this->data = (void*)malloc((this->data_maxsize + this->queue_size) * this->sizeoftype);
+		if (!this->data) {
+			writeError(STR_ERR_INST_QUEUE_QPUSH);
+			this->data = olddata;
+			return;
+		}
+
+		int data_i = 0;
+		for (int i = this->data_begin; i < this->data_maxsize; ++i) memcpy(this->data + this->sizeoftype * (data_i++), olddata + this->sizeoftype * i, this->sizeoftype);
+		for (int i = 0; i < this->data_begin; ++i) memcpy(this->data + this->sizeoftype * (data_i++), olddata + this->sizeoftype * i, this->sizeoftype);
+
+		free(olddata);
+		this->data_maxsize += this->queue_size;
+		this->data_begin = 0;
+	}
+	if (this->data_begin + this->data_size < this->data_maxsize) memcpy(this->data + this->sizeoftype * (this->data_begin + this->data_size), value, this->sizeoftype);
+	else memcpy(this->data + this->sizeoftype * (this->data_begin + this->data_size - this->data_maxsize), value, this->sizeoftype);
+	++this->data_size;
+}
+
+void Q_pop(Queue* this, void* returnValue) {
+	if (this->data_size > 0) {
+		if (returnValue) memcpy(returnValue, this->data + this->sizeoftype * this->data_begin, this->sizeoftype);
+		++this->data_begin;
+		if (this->data_begin == this->data_maxsize)
+			this->data_begin = 0;
+		--this->data_size;
+	} else writeErrorF(STR_ERR_QUEUE_QPOP);
+}
+
+//WARNING: Be sure not to pass nullptr
+void Q_front(Queue* this, void* returnValue) {
+	if (this->data_size > 0) memcpy(returnValue, this->data + this->sizeoftype * this->data_begin, this->sizeoftype);
+	else writeErrorF(STR_ERR_QUEUE_QFRONT);
+}
+
+unsigned int Q_size(Queue* this) {
+	return this->data_size;
+}
+
+//NOTICE: Doesn't free used memory. Will use it for next pushes.
+void Q_clear(Queue* this) {
+	this->data_begin = 0;
+	this->data_size = 0;
+}
+
+//WARNING: Be sure not to pass nullptr
+void Q_at(Queue* this, int i, void* returnValue) {
+	if (this->data_begin + i < this->data_maxsize)
+		memcpy(returnValue, this->data + this->sizeoftype * (this->data_begin + i), this->sizeoftype);
+	else
+		memcpy(returnValue, this->data + this->sizeoftype * (this->data_begin + i - this->data_maxsize), this->sizeoftype);
+}
+//</Queue>
+
+void consoleInit() {
+	if (con_init()) { // Init fail
+		writeErrorF(STR_ERR_CONSOLEINIT);
+		exit(2);
+	}
+	(*con_set_title)(STR_PROGRAM_TITLENAME);
+}
+
+void consoleExit() {
+	(*con_exit)(0);
+}
+
+int getColorByID(int id) {
+	switch (id) {
+		case 0:
+			return 0x000000;
+		case 1:
+			return 0x800000;
+		case 2:
+			return 0x008000;
+		case 3:
+			return 0x808000;
+		case 4:
+			return 0x000080;
+		case 5:
+			return 0x800080;
+		case 6:
+			return 0x008080;
+		case 7:
+			return 0xc0c0c0;
+	}
+}
+
+//perc should be from 0 to 1
+uint32_t getColorBetween(float perc, uint32_t col1, uint32_t col2) {
+	uint8_t* col1c = (uint8_t*)&col1;// { a, r, g, b }
+	uint8_t* col2c = (uint8_t*)&col2;
+	uint32_t res = col1;
+	uint8_t* resc = (uint8_t*)&res;
+	for (int i = 0; i < 4; ++i) resc[i] += ((int)col2c[i]-(int)col1c[i])*perc;
+	return res;
+}
+
+typedef struct {
+	int pos;
+	int length;
+	int gradLen;
+	char* sequence; // if first element is '\0' then its an empty row
+} MatrixRow;
+
+#include <time.h>
+
+int main(int argc, char** argv) {
+	char* t = concat(STR_PROGRAM_NAME, " -- ");
+	STR_PROGRAM_TITLENAME = concat(t, STR_PROGRAM_MOTD);
+	free(t);
+
+	int fgcolor = 32, bgcolor = 40, hlcolor = 37, matrixDelay = 10;
+	uint32_t fgcolorrgb = 0, bgcolorrgb = 0, hlcolorrgb = 0;
+	bool runInShell = false;
+	bool ssRun = false;
+	bool ccopt = false;
+	for (int i = 1; i < argc; ++i) {
+		if (!strcmp(argv[i], "--help") || !strcmp(argv[i], "-h")) {
+			consoleInit();
+			printf(STR_MSG_HELP_USAGE, argv[0]);
+			for (int j = 0; j < sizeof(STR_MSG_HELP)/sizeof(STR_MSG_HELP[0]); ++j) puts(STR_MSG_HELP[j]);
+			consoleExit();
+			return 0;
+		} else if (!strcmp(argv[i], "--version")) {
+			consoleInit();
+			for (int j = 0; j < sizeof(STR_MSG_VERSION)/sizeof(STR_MSG_VERSION[0]); ++j) puts(STR_MSG_VERSION[j]);
+			consoleExit();
+			return 0;
+		} else if (!strcmp(argv[i], "--foreground") || !strcmp(argv[i], "-F")) {
+			if (i + 1 < argc) {
+				if (!strcmp(argv[i+1], "black")) {
+					fgcolor = 30;
+				} else if (!strcmp(argv[i+1], "red")) {
+					fgcolor = 31;
+				} else if (!strcmp(argv[i+1], "green")) {
+					fgcolor = 32;
+				} else if (!strcmp(argv[i+1], "brown")) {
+					fgcolor = 33;
+				} else if (!strcmp(argv[i+1], "blue")) {
+					fgcolor = 34;
+				} else if (!strcmp(argv[i+1], "purple")) {
+					fgcolor = 35;
+				} else if (!strcmp(argv[i+1], "turqoise")) {
+					fgcolor = 36;
+				} else if (!strcmp(argv[i+1], "white")) {
+					fgcolor = 37;
+				} else {
+					uint32_t rValue = -1, gValue = -1, bValue = -1;
+					if (sscanf(argv[i+1], "%d,%d,%d", &rValue, &gValue, &bValue) != 3 ||
+							rValue < 0 || rValue > 255 ||
+							gValue < 0 || gValue > 255 ||
+							bValue < 0 || bValue > 255) {
+						consoleInit();
+						printf(STR_MSG_INVARG_COLOR, argv[0], argv[i+1]);
+						consoleExit();
+						return 1;
+					}
+					fgcolor = -1;
+					fgcolorrgb = bValue | (gValue << 8) | (rValue << 16);
+				}
+				i += 1;
+			} else {
+				consoleInit();
+				printf(STR_MSG_NOARG, argv[0], argv[i]);
+				printf(STR_MSG_HELPADVICE, argv[0]);
+				consoleExit();
+				return 1;
+			}
+		} else if (!strcmp(argv[i], "--background") || !strcmp(argv[i], "-B")) {
+			if (i + 1 < argc) {
+				if (!strcmp(argv[i+1], "black")) {
+					bgcolor = 40;
+				} else if (!strcmp(argv[i+1], "red")) {
+					bgcolor = 41;
+				} else if (!strcmp(argv[i+1], "green")) {
+					bgcolor = 42;
+				} else if (!strcmp(argv[i+1], "brown")) {
+					bgcolor = 43;
+				} else if (!strcmp(argv[i+1], "blue")) {
+					bgcolor = 44;
+				} else if (!strcmp(argv[i+1], "purple")) {
+					bgcolor = 45;
+				} else if (!strcmp(argv[i+1], "turqoise")) {
+					bgcolor = 46;
+				} else if (!strcmp(argv[i+1], "white")) {
+					bgcolor = 47;
+				} else {
+					uint32_t rValue = -1, gValue = -1, bValue = -1;
+					if (sscanf(argv[i+1], "%d,%d,%d", &rValue, &gValue, &bValue) != 3 ||
+							rValue < 0 || rValue > 255 ||
+							gValue < 0 || gValue > 255 ||
+							bValue < 0 || bValue > 255) {
+						consoleInit();
+						printf(STR_MSG_INVARG_COLOR, argv[0], argv[i+1]);
+						consoleExit();
+						return 1;
+					}
+					bgcolor = -1;
+					bgcolorrgb = bValue | (gValue << 8) | (rValue << 16);
+				}
+				i += 1;
+			} else {
+				consoleInit();
+				printf(STR_MSG_NOARG, argv[0], argv[i]);
+				printf(STR_MSG_HELPADVICE, argv[0]);
+				consoleExit();
+				return 1;
+			}
+		} else if (!strcmp(argv[i], "--highlight") || !strcmp(argv[i], "-H")) {
+			if (i + 1 < argc) {
+				if (!strcmp(argv[i+1], "black")) {
+					hlcolor = 30;
+				} else if (!strcmp(argv[i+1], "red")) {
+					hlcolor = 31;
+				} else if (!strcmp(argv[i+1], "green")) {
+					hlcolor = 32;
+				} else if (!strcmp(argv[i+1], "brown")) {
+					hlcolor = 33;
+				} else if (!strcmp(argv[i+1], "blue")) {
+					hlcolor = 34;
+				} else if (!strcmp(argv[i+1], "purple")) {
+					hlcolor = 35;
+				} else if (!strcmp(argv[i+1], "turqoise")) {
+					hlcolor = 36;
+				} else if (!strcmp(argv[i+1], "white")) {
+					hlcolor = 37;
+				} else {
+					uint32_t rValue = -1, gValue = -1, bValue = -1;
+					if (sscanf(argv[i+1], "%d,%d,%d", &rValue, &gValue, &bValue) != 3 ||
+							rValue < 0 || rValue > 255 ||
+							gValue < 0 || gValue > 255 ||
+							bValue < 0 || bValue > 255) {
+						consoleInit();
+						printf(STR_MSG_INVARG_COLOR, argv[0], argv[i+1]);
+						consoleExit();
+						return 1;
+					}
+					hlcolor = -1;
+					hlcolorrgb = bValue | (gValue << 8) | (rValue << 16);
+				}
+				i += 1;
+			} else {
+				consoleInit();
+				printf(STR_MSG_NOARG, argv[0], argv[i]);
+				printf(STR_MSG_HELPADVICE, argv[0]);
+				consoleExit();
+				return 1;
+			}
+		} else if (!strcmp(argv[i], "--speed") || !strcmp(argv[i], "-S")) {
+			if (i + 1 < argc) {
+				int speedValue = 0;
+				if (!sscanf(argv[i+1], "%d", &speedValue) || speedValue <= 0) {
+					consoleInit();
+					printf(STR_MSG_INVARG_SPEED, argv[0], argv[i+1]);
+					consoleExit();
+					return 1;
+				}
+				matrixDelay = 100 / speedValue;
+				i += 1;
+			} else {
+				consoleInit();
+				printf(STR_MSG_NOARG, argv[0], argv[i]);
+				printf(STR_MSG_HELPADVICE, argv[0]);
+				consoleExit();
+				return 1;
+			}
+		} else if (!strcmp(argv[i], "--shell")) {
+			runInShell = true;
+		} else if (!strcmp(argv[i], "@ss")) {
+			ssRun = true;
+		} else if (!strcmp(argv[i], "--ccopt")) {
+			ccopt = true;
+		} else {
+			consoleInit();
+			printf(STR_MSG_UNRARG, argv[0], argv[i]);
+			printf(STR_MSG_HELPADVICE, argv[0]);
+			consoleExit();
+			return 1;
+		}
+	}
+
+	if (runInShell && (fgcolor == -1 || bgcolor == -1 || hlcolor == -1)) {
+		consoleInit();
+		printf(STR_MSG_CON_RGB, argv[0]);
+		printf(STR_MSG_HELPADVICE, argv[0]);
+		consoleExit();
+		return 1;
+	}
+
+	if (runInShell && ssRun) {
+		consoleInit();
+		printf(STR_MSG_CON_SS, argv[0]);
+		printf(STR_MSG_HELPADVICE, argv[0]);
+		consoleExit();
+		return 1;
+	}
+
+	int bakedTable_size = '~'-'!';
+	char bakedTable[bakedTable_size];
+	for (char c = '!'; c < '\\'; ++c) bakedTable[c-'!'] = c;
+	for (char c = '\\'+1; c <= '~'; ++c) bakedTable[c-'!'-1] = c;
+
+	rand_r_seed = time(NULL);
+
+	int colorType = 0; // { FG = 0, BG = 1, HL = 2 }
+	int delayTypesSize = 5;
+	int delayTypes[] = { 33, 22, 10, 4, 1};
+	int delayTypeIdx = -1;
+
+	// I divide it in two parts because we don't want some additional operations in while(true)   (checkings if it's running in shell)
+	if (runInShell) {
+		consoleInit();
+		int initCurHeight = (*con_get_cursor_height)();
+		(*con_set_cursor_height)(0);
+		printf("\033[%d;%dm", fgcolor, bgcolor);
+		for (int i = 0; i < CONSOLE_WIDTH*CONSOLE_HEIGHT; ++i) putc(' ');
+		bool lastWasHighlighted = false;
+
+		Queue* q[CONSOLE_WIDTH/2];
+		for (int x = 0; x < CONSOLE_WIDTH/2; ++x) q[x] = Q_alloc(sizeof(MatrixRow*), 0);
+		MatrixRow* mr;
+		while (true) {
+			for (int x = 0; x < CONSOLE_WIDTH/2; ++x) {
+				if (Q_size(q[x])) {
+					Q_at(q[x], 0, &mr);
+					if (mr->pos + 1 == CONSOLE_HEIGHT) {
+						Q_pop(q[x], 0);
+						free(mr->sequence);
+ 						free(mr);
+					}
+				}
+				for (int i = 0; i < Q_size(q[x]); ++i) {
+					Q_at(q[x], i, &mr);
+					int idx = mr->pos + mr->length - 1;
+					if (idx < CONSOLE_HEIGHT) {
+						(*con_set_cursor_pos)(x*2, idx);
+						char tc = (mr->sequence[0] == '\0') ? ' ' : mr->sequence[idx];
+						if (!lastWasHighlighted) putc(tc);
+						else { printf("\033[%dm%c", fgcolor, tc); lastWasHighlighted = 0; }
+					}
+					++(mr->pos);
+					idx = mr->pos + mr->length - 1;
+					if (idx < CONSOLE_HEIGHT) {
+						(*con_set_cursor_pos)(x*2, idx);
+						char tc = (mr->sequence[0] == '\0') ? ' ' : mr->sequence[idx];
+						if (lastWasHighlighted) putc(tc);
+						else { printf("\033[%dm%c", hlcolor, tc); lastWasHighlighted = 1; }
+					}
+				}
+
+				bool needToAdd = !Q_size(q[x]);
+				if (!needToAdd) {
+					Q_at(q[x], Q_size(q[x]) - 1, &mr);
+					needToAdd = (mr->pos > 0);
+				}
+				if (needToAdd) {
+					bool mrseq0 = 0;
+					if (Q_size(q[x])) mrseq0 = (mr->sequence[0] != '\0');
+					mr = (MatrixRow*)malloc(sizeof(MatrixRow));
+					if (!mr) {
+						writeError(STR_ERR_INST_MAIN_MROWALLOC);
+						continue;
+					}
+					mr->length = (rand_r() % CONSOLE_HEIGHT) + 1;
+					mr->pos = 1 - mr->length;
+					if (!mrseq0 && (rand_r() % 3) == 2) { // 33% chance of being row with symbols
+						mr->sequence = (char*)malloc(CONSOLE_HEIGHT);
+						if (!mr->sequence) {
+							writeError(STR_ERR_INST_MAIN_MROWSECALLOC);
+							free(mr);
+							continue;
+						}
+						for (int i = 0; i < CONSOLE_HEIGHT; ++i)
+							mr->sequence[i] = bakedTable[rand_r() % bakedTable_size];
+					} else {
+						mr->sequence = (char*)malloc(1);
+						if (!mr->sequence) {
+							writeError(STR_ERR_INST_MAIN_MROWSECALLOC);
+							free(mr);
+							continue;
+						}
+ 						mr->sequence[0] = '\0';
+					}
+					Q_push(q[x], &mr);
+					(*con_set_cursor_pos)(x*2, 0);
+					char tc = (mr->sequence[0] == '\0') ? ' ' : mr->sequence[0];
+					if (lastWasHighlighted) putc(tc);
+					else { printf("\033[%dm%c", hlcolor, tc); lastWasHighlighted = 1; }
+				}
+			}
+
+			_ksys_delay(matrixDelay);
+		}
+
+		//I know it will not be executed.. but it better be executed when something sends STOP-like call when there will be better console.obj and others
+		printf("\033[0m"); // Turning BG and FG to normal
+		(*con_set_cursor_height)(initCurHeight);
+		consoleExit();
+		return 0;
+	} else {
+		if (fgcolor != -1) fgcolorrgb = getColorByID(fgcolor % 10);
+		if (bgcolor != -1) bgcolorrgb = getColorByID(bgcolor % 10);
+		if (hlcolor != -1) hlcolorrgb = getColorByID(hlcolor % 10);
+
+		ksys_pos_t screenSize = _ksys_screen_size(); // WARNING: If user changes screen resolution while this program is running, here probably could occur bug
+		screenSize.x += 1; screenSize.y += 1; // Yep, that's really needed :/
+
+		if (ssRun) _ksys_set_event_mask(0x27); // Enable mouse events
+		_ksys_set_input_mode(1); // Enable scancode mode
+
+		// Make the cursor be transparent
+		char* transpCur = (char*)calloc(32*32, 1);
+		if (!transpCur) writeError(STR_ERR_INST_MAIN_TCURALLOC);
+		else {
+			uint32_t loadedCurHandle = _ksys_load_cursor(transpCur, 2);
+			free(transpCur);
+			if (!loadedCurHandle) writeErrorF(STR_ERR_MAIN_TCURLOAD);
+			else _ksys_set_cursor(loadedCurHandle);
+		}
+
+		int console_width = screenSize.x / SYSFN04_FONT_W;
+		int console_height = screenSize.y / SYSFN04_FONT_H;
+
+		char ss[2];
+		ss[1] = '\0';
+
+		Queue* q[console_width/2];
+		for (int x = 0; x < console_width/2; ++x) q[x] = Q_alloc(sizeof(MatrixRow*), 0);
+		MatrixRow* mr;
+
+		int event;
+		char needsRedrawing = 0; // { NO = 0, YES = 1, ONLY_TEXT = 2 }
+		while (true) {
+			while ((event = _ksys_check_event()) != KSYS_EVENT_NONE) {
+				switch (event) {
+					case KSYS_EVENT_REDRAW:
+						_ksys_create_window(0, 0, screenSize.x, screenSize.y, STR_PROGRAM_TITLENAME, bgcolorrgb, 0x31);
+						needsRedrawing = 1;
+						break;
+					case KSYS_EVENT_BUTTON:
+						switch (_ksys_get_button()) {
+							case BTN_QUIT:
+								return 0;
+						}
+						break;
+					case KSYS_EVENT_MOUSE:
+						if (ssRun) {
+							_ksys_exec(ss_path, "");
+							return 0;
+						}
+						break;
+					case KSYS_EVENT_KEY:
+						if (ssRun) {
+							_ksys_exec(ss_path, "");
+							return 0;
+						}
+						ksys_oskey_t kc = _ksys_get_key();
+						if (kc.code == 1) // [ESC]
+							return 0;
+						else if (kc.code >= 2 && kc.code <= 9) { // from [1] to [8]
+							switch (colorType) {
+								case 0: { // FG
+									fgcolor = 30 + (kc.code - 2);
+									uint32_t oldcolorrgb = fgcolorrgb;
+									fgcolorrgb = getColorByID(kc.code - 2);
+									if (oldcolorrgb != fgcolorrgb) {
+										if (ccopt) { if (!needsRedrawing) needsRedrawing = 2; }
+										else needsRedrawing = 1;
+									}
+									break;
+								}
+								case 1: { // BG
+									bgcolor = 40 + (kc.code - 2);
+									uint32_t oldcolorrgb = bgcolorrgb;
+									bgcolorrgb = getColorByID(kc.code - 2);
+									if (oldcolorrgb != bgcolorrgb) needsRedrawing = 1;
+									break;
+								}
+								case 2: // HL
+									hlcolor = 30 + (kc.code - 2);
+									hlcolorrgb = getColorByID(kc.code - 2);
+									break;
+							}
+						} else if (kc.code == 12 || kc.code == 13) { // [-] or [+]
+							if (delayTypeIdx == -1) {
+								delayTypeIdx = 0;
+								while (delayTypeIdx < delayTypesSize && matrixDelay < delayTypes[delayTypeIdx]) ++delayTypeIdx;
+								if (delayTypeIdx == delayTypesSize) --delayTypeIdx;
+							}
+							if (kc.code == 12) { // Decrease
+								if (delayTypeIdx > 0) --delayTypeIdx;
+							} else { // Increase
+								if (delayTypeIdx + 1 < delayTypesSize) ++delayTypeIdx;
+							}
+							matrixDelay = delayTypes[delayTypeIdx];
+						} else if (kc.code == 41) { // [~]
+							colorType++;
+							if (colorType == 3) colorType = 0;
+						}
+						break;
+					default:
+						break;
+				}
+			}
+
+			if (needsRedrawing) {
+				if (needsRedrawing == 1) _ksys_draw_bar(0, 0, screenSize.x, screenSize.y, bgcolorrgb);
+				for (int x = 0; x < console_width/2; ++x) {
+					for (int i = 0; i < Q_size(q[x]); ++i) {
+						Q_at(q[x], i, &mr);
+						if (mr->sequence[0] != '\0') {
+							int y = mr->pos;
+							if (y < 0) y = 0;
+							for (; y < mr->pos + mr->gradLen && y < console_height; ++y) {
+								ss[0] = mr->sequence[y];
+								_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, y*SYSFN04_FONT_H, 0, 0x90000000 | getColorBetween(((float)y - mr->pos + 1) / (mr->gradLen + 1), bgcolorrgb, fgcolorrgb));
+							}
+							for (; y < mr->pos + mr->length - 1 && y < console_height; ++y) {
+								ss[0] = mr->sequence[y];
+								_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, y*SYSFN04_FONT_H, 0, 0x90000000 | fgcolorrgb);
+							}
+							if (y == mr->pos + mr->length - 1 && y < console_height) {
+								ss[0] = mr->sequence[y];
+								_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, y*SYSFN04_FONT_H, 0, 0x90000000 | hlcolorrgb);
+							}
+						}
+					}
+				}
+				needsRedrawing = 0;
+			}
+
+			for (int x = 0; x < console_width/2; ++x) {
+				if (Q_size(q[x])) {
+					Q_at(q[x], 0, &mr);
+					if (mr->pos + 1 == console_height) {
+						Q_pop(q[x], 0);
+						free(mr->sequence);
+						free(mr);
+					}
+				}
+				for (int i = 0; i < Q_size(q[x]); ++i) {
+					Q_at(q[x], i, &mr);
+					++(mr->pos);
+					int idx;
+					if (mr->sequence[0] != '\0') {
+						idx = mr->pos;
+						if (idx < 0) idx = 0;
+						for (; idx < mr->pos + mr->gradLen && idx < console_height; ++idx) {
+							if (!ccopt) _ksys_draw_bar(x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, SYSFN04_FONT_W, SYSFN04_FONT_H, bgcolorrgb);
+							ss[0] =  mr->sequence[idx];
+							_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, 0, 0x90000000 | getColorBetween(((float)idx - mr->pos + 1) / (mr->gradLen + 1), bgcolorrgb, fgcolorrgb));
+	 					}
+						idx = mr->pos + mr->length - 2;
+						if (idx < console_height) {
+							if (!ccopt) _ksys_draw_bar(x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, SYSFN04_FONT_W, SYSFN04_FONT_H, bgcolorrgb);
+							ss[0] =  mr->sequence[idx];
+							_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, 0, 0x90000000 | fgcolorrgb);
+	 					}
+ 					}
+					idx = mr->pos + mr->length - 1;
+					if (idx < console_height) {
+						_ksys_draw_bar(x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, SYSFN04_FONT_W, SYSFN04_FONT_H, bgcolorrgb);
+						if (mr->sequence[0] != '\0') {
+							ss[0] =  mr->sequence[idx];
+							_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, idx*SYSFN04_FONT_H, 0, 0x90000000 | hlcolorrgb);
+						}
+					}
+				}
+
+				bool needToAdd = !Q_size(q[x]);
+				if (!needToAdd) {
+					Q_at(q[x], Q_size(q[x]) - 1, &mr);
+					needToAdd = (mr->pos > 0);
+				}
+				if (needToAdd) {
+					bool mrseq0 = 0;
+					if (Q_size(q[x])) mrseq0 = (mr->sequence[0] != '\0');
+					mr = (MatrixRow*)malloc(sizeof(MatrixRow));
+					if (!mr) {
+						writeError(STR_ERR_INST_MAIN_MROWALLOC);
+						continue;
+					}
+					mr->length = (rand_r() % console_height) + 1;
+					if (mr->length < 3) mr->gradLen = 0; //especially for len=2 (to avoid render twicely)
+					else                mr->gradLen = rand_r() % (mr->length / 2 + 1); // "mr->length / 2" probably can be changed to "mr->length - mr->length / 3" if you want to encounter maximum 2/3 tinted rows
+					mr->pos = 1 - mr->length;
+					if (!mrseq0 && (rand_r() % 3) == 2) { // 33% chance of being row with symbols
+						mr->sequence = (char*)malloc(console_height);
+						if (!mr->sequence) {
+							writeError(STR_ERR_INST_MAIN_MROWSECALLOC);
+							free(mr);
+							continue;
+						}
+						for (int i = 0; i < console_height; ++i)
+							mr->sequence[i] = bakedTable[rand_r() % bakedTable_size];
+					} else {
+						mr->sequence = (char*)malloc(1);
+						if (!mr->sequence) {
+							writeError(STR_ERR_INST_MAIN_MROWSECALLOC);
+							free(mr);
+							continue;
+						}
+						mr->sequence[0] = '\0';
+					}
+					Q_push(q[x], &mr);
+					_ksys_draw_bar(x*2*SYSFN04_FONT_W, 0, SYSFN04_FONT_W, SYSFN04_FONT_H, bgcolorrgb);
+					if (mr->sequence[0] != '\0') {
+						ss[0] =  mr->sequence[0];
+ 						_ksys_draw_text(ss, x*2*SYSFN04_FONT_W, 0, 0, 0x90000000 | hlcolorrgb);
+					}
+				}
+			}
+
+			_ksys_delay(matrixDelay);
+		}
+	}
+	return 0;
+}