output_description: For each front operation, print an integer in a line.
input_description: The input is given in the following format.
  
      
      
      $n \; q$
      $query_1$
      $query_2$
      :
      $query_q$
      
  
  Each query $query_i$ is given by
  
      
      
      0 $t$ $x$
      
  
  or
  
      
      
      1 $t$
      
  
  or
  
      
      
      2 $t$
      
  
  where the first digits 0, 1 and 2 represent enqueue, front and dequeue
  operations respectively.
attempt: from collections import deque
  
  
  def enqueue(t, x):
      global Qlist
      Qlist[t].appendleft(x)
  
  
  def front(t):
      global Qlist
      if Qlist[t] != deque():
          print(Qlist[t][-1])
  
  
  def dequeue(t):
      global Qlist
      if Qlist[t] != deque():
          Qlist[t].pop()
  
  
  n, q = map(int, input().split())
  Qlist = []
  for i in range(n):
      Q = deque()
      Qlist.append(Q)
  
  for j in range(q):
      queryi = list(map(int, input().split()))
  
      if queryi[0] == 0:
          enqueue(queryi[1], queryi[2])
  
      elif queryi[0] == 1:
          front(queryi[1])
  
      else:
          dequeue(queryi[1])
  
problem_description: Queue
  
  Queue is a container of elements that are inserted and deleted according to
  FIFO (First In First Out).
  
  For $n$ queues $Q_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the
  following operations.
  
    * enqueue($t$, $x$): Insert an integer $x$ to $Q_t$.
    * front($t$): Report the value which should be deleted next from $Q_t$. If $Q_t$ is empty, do nothing.
    * dequeue($t$): Delete an element from $Q_t$. If $Q_t$ is empty, do nothing.
  
  In the initial state, all queues are empty.
samples: [{"input": "3 9\n    0 0 1\n    0 0 2\n    0 0 3\n    0 2 4\n    0 2 5\n    1 0\n    1 2\n    2 0\n    1 0", "output": "1\n    4\n    2"}]