import static java.lang.Math.*;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt(), k = in.nextInt();
			int[][] mat = new int[11][7];
			int cmat0 = 0, cmat1 = 0;
			for (int i = 0; i < 11; i++) {
				for (int j = 0; j < 7; j++) {
					mat[i][j] = (j+1)+i*7;
					mat[i][j] %= 11;
				}
			}

			long ans = 0;
			if (n <= 11) {
				for (int i = 0; i < n; i++) {
					for (int j = 0; j < 7; j++) {
						int sum = 0;
						if (1 <= i && i < n-1 && 1 <= j && j < 6) {
							for (int l = -1; l <= 1; l++) {
								for (int m = -1; m <= 1; m++) {
									sum += mat[(i+l+11)%11][j+m];
								}
							}
						}
						if (1 <= i && i < n-1 && 1 <= j && j < 6) {
							if (sum % 11 == k) ans++;
						}
					}
				}
				out.println(ans);
				return;
			}

			for (int i = 0; i < 11; i++) {
				for (int j = 0; j < 7; j++) {
					int sum = 0;
					if (1 <= i && 1 <= j && j < 6) {
						for (int l = -1; l <= 1; l++) {
							for (int m = -1; m <= 1; m++) {
								sum += mat[(i+l+11)%11][j+m];
							}
						}
					}
					if (1 <= i && 1 <= j && j < 6) {
						if (sum % 11 == k) cmat0++;
					}
				}
			}

			for (int i = 0; i < 11; i++) {
				for (int j = 0; j < 7; j++) {
					int sum = 0;
					if (1 <= j && j < 6) {
						for (int l = -1; l <= 1; l++) {
							for (int m = -1; m <= 1; m++) {
								sum += mat[(i+l+11)%11][j+m];
							}
						}
					}
					if (1 <= j && j < 6) {
						if (sum % 11 == k) cmat1++;
					}
				}
			}


			ans += max(n/11-1, 0) * cmat1 + (n/11-1 >= 0 ? cmat0 : 0);

			n %= 11;
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < 7; j++) {
					int sum = 0;
					if (i < n-1 && 1 <= j && j < 6) {
						for (int l = -1; l <= 1; l++) {
							for (int m = -1; m <= 1; m++) {
								sum += mat[(i+l+11)%11][j+m];
							}
						}
					}
					if (i < n-1 && 1 <= j && j < 6) {
						if (sum % 11 == k) ans++;
					}
				}
			}

			out.println(ans);

		}
	}

	static void print(int[][] dp) {
		int n = dp.length;
		int m = dp[0].length;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				System.out.print(dp[i][j] + " ");
			}
			System.out.print("\n");
		}
		System.out.print("\n");
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}


Measured memory_bytes: 23252