class HashMap:
    def __init__(self):
        self.bucket = []
        for i in range(7):
            self.bucket.append([])

        print("hashmap initialized (exploring data structures beyond built-ins)")
        # i genuinely love hashmaps <3

    def put(self, key, value):
        index = hash(key) % len(self.bucket)

        for i, (k, v) in enumerate(self.bucket[index]):
            if k == key:
                self.bucket[index][i][1] = value
                print(f"updated '{key}' with new value")
                return

        self.bucket[index].append([key, value])
        print(f"added '{key}' → '{value}'")

    def get(self, key):
        index = hash(key) % len(self.bucket)

        for k, v in self.bucket[index]:
            if k == key:
                print(f"found '{key}'")
                return v

        print(f"'{key}' not found (maybe added it later)")
        return None

    def remove(self, key):
        index = hash(key) % len(self.bucket)

        before = len(self.bucket[index])
        self.bucket[index] = [pair for pair in self.bucket[index] if pair[0] != key]
        after = len(self.bucket[index])

        if before != after:
            print(f"removed '{key}'")
        else:
            print(f"'{key}' wasn’t there anyway")