To generate the table, we choose a random set of "initial passwords" from P, compute chains of some fixed length "k" for each one, and store "only" the first and last password in each chain. The first password is called the "starting point" and the last one is called the "endpoint". In the example chain above, "aaaaaa" would be the starting point and "kiebgt" would be the endpoint, and none of the other passwords (or the hash values) would be stored.