output_description: Print the maximum flow.
input_description: A flow network is given in the following format.
  
  $|V|\;|E|$  
  $u_0\;v_0\;c_0$  
  $u_1\;v_1\;c_1$  
  :  
  $u_{|E|-1}\;v_{|E|-1}\;c_{|E|-1}$  
    
  
  $|V|$, $|E|$ is the number of vertices and edges of the flow network
  respectively. The vertices in $G$ are named with the numbers 0, 1,...,
  $|V|-1$. The source is 0 and the sink is $|V|-1$.
  
  $u_i$, $v_i$, $c_i$ represent $i$-th edge of the flow network. A pair of $u_i$
  and $v_i$ denotes that there is an edge from $u_i$ to $v_i$ and $c_i$ is the
  capacity of $i$-th edge.
attempt: n, q = list(map(int, input().split(" ")))
  
  process = []
  for i in range(n):
      process.append(input().split(" "))
      process[i][1] = int(process[i][1])
  
  timer = 0
  fin_time = []
  num_of_proc = n
  while num_of_proc > 0:
      for i in range(n):
          if process[i][1] == 0:
              continue
          elif process[i][1] <= q:
              num_of_proc -= 1
              timer += process[i][1]
              process[i][1] = 0
              fin_time.append([process[i][0], timer])
          else:
              timer += q
              process[i][1] -= q
  
  for t in fin_time:
      print(t[0], t[1])
  
problem_description: Maximum Flow
  
  A flow network is a directed graph which has a $source$ and a $sink$. In a
  flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives
  a flow, but the amount of flow on the edge can not exceed the corresponding
  capacity. Find the maximum flow from the $source$ to the $sink$.
samples: [{"input": "4 5\n    0 1 2\n    0 2 1\n    1 2 1\n    1 3 1\n    2 3 2", "output": "3"}]