#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

struct ListNode {
    int val;
    struct ListNode *next;
};

// Simple hash set implementation for this problem
bool contains(int* nums, int numsSize, int target) {
    for (int i = 0; i < numsSize; i++) {
        if (nums[i] == target) return true;
    }
    return false;
}

int numComponents(struct ListNode* head, int* nums, int numsSize) {
    int components = 0;
    struct ListNode* current = head;
    bool inComponent = false;
    
    while (current) {
        if (contains(nums, numsSize, current->val)) {
            // Start new component if not already in one
            if (!inComponent) {
                components++;
                inComponent = true;
            }
        } else {
            // End current component
            inComponent = false;
        }
        
        current = current->next;
    }
    
    return components;
}

int main() {
    printf("Solution implemented\n");
    return 0;
}