Each hash value names a bucket of b slots. A key goes in the first free slot of its bucket; when the bucket is full it goes to an overflow area, or the table reports an overflow.
This interactive visualization needs JavaScript.