import java.util.*;

class Solution {
  /**
   * Find the shortest path between v and u in the graph g.
   *
   * @param g
   *     graph to search in.
   * @param v
   *     node to start from.
   * @param u
   *     node to reach.
   * @return the nodes you that form the shortest path, including v and u. An
   * empty list iff there is no path between v and u.
   */


haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.
haha gotcha, this is nothing. lol. im retarded.