output_description: If no permutation of (1, 2, ..., 2N-1) could have been written into the blocks
  of step N, print `No`.
  
  Otherwise, print `Yes` in the first line, then print 2N-1 lines in addition.
  
  The i-th of these 2N-1 lines should contain the i-th element of a possible
  permutation.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N x
attempt: print("No")
  
problem_description: Statement
  
  We have a pyramid with N steps, built with blocks. The steps are numbered 1
  through N from top to bottom. For each 1≤i≤N, step i consists of 2i-1 blocks
  aligned horizontally. The pyramid is built so that the blocks at the centers
  of the steps are aligned vertically.
  
  ![](https://atcoder.jp/img/agc006/a2bde72df5ad036d1699f4a74d74a370.png)
  
  A pyramid with N=4 steps
  
  Snuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.
  Then, he wrote integers into all remaining blocks, under the following rule:
  
    * The integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.
  
  ![](https://atcoder.jp/img/agc006/a940f1d8303f255e1f91d17a5696633f.png)
  
  Writing integers into the blocks
  
  Afterwards, he erased all integers written into the blocks. Now, he only
  remembers that the integer written into the block of step 1 was x.
  
  Construct a permutation of (1, 2, ..., 2N-1) that could have been written into
  the blocks of step N, or declare that Snuke's memory is incorrect and such a
  permutation does not exist.
samples: [{"input": "4 4", "output": "Yes\n    1\n    6\n    3\n    7\n    4\n    5\n    2\n    \n\nThis case corresponds to the figure in the problem statement.\n\n* * *"}, {"input": "2 1", "output": "No\n    \n\nNo matter what permutation was written into the blocks of step N, the integer\nwritten into the block of step 1 would be 2."}]