NODE *get_last(NODE *first_node) {
    if (!first_node) return NULL;
    while (first_node->next)
	first_node = first_node->next;
    return first_node;
}