(Solved): In a Rubrik cluster, there are N nodes. There are K wired connections between nodes where ith wir ...

In a Rubrik cluster, there are $N$ nodes. There are $K$ wired connections between nodes where $i^{\text{th }}$ wired connection connects $a_i$ and $b_i$ nodes. Similarly, there are $L$ wireless connections between nodes where ith wireless connection connects $c_i$ and $d_i$ nodes. In each connection, nodes can communicate with each other. Each node determines the number of nodes it can communicate to both via wired connection and wireless connection. No two wired connections connect the same pair of nodes. Similarly, no two wireless connections connect the same pair of nodes. Under the constraints, it can be proven the process of consolidation will terminate. Find the final value to which $N$ integers consolidate. Constraints: - $2?N?2\times 10^5$ - $1?K,L?10^5$ - $1?ai,bi?N,ai?=bi$ - $1?ci,di?N,ci?=di$ Input: The first line of the test case contains three space-separated integers $N,K,L$ - denoting the number of nodes, wired connections, and wireless connections respectively. Next $K$ lines contain $K$ wired connections each containing two space-separated integers $a_i{b}_i$. Next $L$ lines contain $L$ wireless connections each containing two space-separated integers $c_i{d}_i$. Output: the $i^{\text{th }}$ node by both wired and wireless routes. Sample Input Output: the $i^{\text{th }}$ node by both wired and wireless routes. Sample Input $4\begin{array}{lll}4& 3& 1\end{array}$ 12 23 34 23 Sample Output 1221 Sample Explanation All four nodes are connected to each other by a wired connection. Only the $2^{\text{nd }}$ and $3^{\text{rd }}$ nodes are connected by wireless connection. Thus, the answers for the cities are 1, 2, 2, and 1 respectively.