The VERTEX-COVER problem is to find a vertex cover of size $k$ in a given graph $G$. In the SUBSET-SUM problem, given a finite set $S \subset \mathbb N$ and a target $t \in \mathbb N$, we ask whether there is a subset $S' \subseteq S$ whose elements sum to $t$. The VERTEX-COVER problem is polynomial-time reducible to the SUBSET-SUM problem. Given an instance $\langle G,k\rangle$ of the VERTEX-COVER problem, one can construct a corresponding instance $\langle S,t\rangle$ of the SUBSET-SUM problem. Given the following graph $G$ (5個頂點 $v_0,v_1,v_2,v_3,v_4$，邊 $e_0,e_1,e_2,e_3,e_4$ 構成一個五邊形/五角星) and $k=3$, $\{v_1,v_3,v_4\}$ is the vertex cover of size $k=3$. The corresponding set $S=\{1,4,16,64,256,1040,1041,1093,1284,1344\}$ is constructed as the following table (modified based-4 representation, digits for $e_4 e_3 e_2 e_1 e_0$):

What is the target $t$? (A) 2389 (B) 3417 (C) 3754 (D) 3758