output_description: * Print the number of good sub-grid. If there are no solution exists, print `0`.
input_description: The input is given from standard input in the following format.  
    
  
  > $n \quad k$
attempt: a = input()
  b = input()
  print(a + b)
  
problem_description: Statement
  
  Snuke has a very long calendar. It has a grid with $n$ rows and $7$ columns.
  One day, he noticed that calendar has a following regularity.  
  
    * The cell at the $i$-th row and $j$-th column contains the integer $7i+j-7$.
  
  A good sub-grid is a $3 \times 3$ sub-grid and the sum of integers in this
  sub-grid mod $11$ is $k$.  
  How many good sub-grid are there? Write a program and help him.
samples: [{"input": "7 7", "output": "2\n    \n\nIn this case, the calendar likes this matrix.  \n| Sun. | Mon. | Tue. | Wed. | Thu. | Fri. | Sat.  \n---|---|---|---|---|---|---|---  \nWeek 1 | 1 | 2 | 3 | 4 | 5 | 6 | 7  \nWeek 2 | 8 | 9 | 10 | 11 | 12 | 13 | 14  \nWeek 3 | 15 | 16 | 17 | 18 | 19 | 20 | 21  \nWeek 4 | 22 | 23 | 24 | 25 | 26 | 27 | 28  \nWeek 5 | 29 | 30 | 31 | 32 | 33 | 34 | 35  \nWeek 6 | 36 | 37 | 38 | 39 | 40 | 41 | 42  \nWeek 7 | 43 | 44 | 45 | 46 | 47 | 48 | 49  \n  \nThe cell at $i$-th row and $j$-th column is denoted $(i, j)$.  \n\n  * If upper-left is $(1, 5)$, the sum of integers is $5+6+7+12+13+14+19+20+21=117$.\n  * If upper-left is $(3, 2)$, the sum of integers is $16+17+18+23+24+25+30+31+32=216$.\n\nTherefore, there are 2 good sub-grids."}, {"input": "6 0", "output": "2\n    \n\nIf upper-left is $(1, 3)$ or $(4, 4)$, it is a good sub-grid."}]