import java.util.Scanner;

public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static String I = "IMPOSSIBLE";
	public static String B = "Bad";
	public static String G = "Good";
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	}

	/*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static String n() {
		return sc.next();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}
} import java.util.Scanner; Scanner java.util public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static String I = "IMPOSSIBLE";
	public static String B = "Bad";
	public static String G = "Good";
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	}

	/*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static String n() {
		return sc.next();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}
} Main public static String Y = "Yes"; Y "Yes" public static String N = "No"; N "No" public static String I = "IMPOSSIBLE"; I "IMPOSSIBLE" public static String B = "Bad"; B "Bad" public static String G = "Good"; G "Good" public static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	} main {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	} int a = ni(); a ni() ni int b = ni(); b ni() ni if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		} a >= 13 a 13 {
			out(b);

		} out(b) out b if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		} a <= 12 && a >= 6 a <= 12 a 12 a >= 6 a 6 {
			out(b / 2);
		} out(b / 2) out b / 2 b 2 {
			out(0);
		} out(0) out 0 String[] args args /*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	} ni {
		return sc.nextInt();
	} return sc.nextInt(); sc.nextInt() sc.nextInt sc static long nl() {
		return sc.nextLong();
	} nl {
		return sc.nextLong();
	} return sc.nextLong(); sc.nextLong() sc.nextLong sc static String n() {
		return sc.next();
	} n {
		return sc.next();
	} return sc.next(); sc.next() sc.next sc static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	} kaijo {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	} if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		} n == 0 || n == 1 n == 0 n 0 n == 1 n 1 {
			return 1;
		} return 1; 1 {
			return n * kaijo(n - 1);
		} return n * kaijo(n - 1); n * kaijo(n - 1) n kaijo(n - 1) kaijo n - 1 n 1 int n n static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	} fib {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	} return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1); (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1) (n == 1 || n == 0) n == 1 n 1 n == 0 n 0 n fib(n - 2) + fib(n - 1) fib(n - 2) fib n - 2 n 2 fib(n - 1) fib n - 1 n 1 int n n static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	} lcm {

		return m * n / gcd(m, n);
	} return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n long m m long n n static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	} lcm {

		return m * n / gcd(m, n);
	} return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n int m m int n n static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	} gcd {
		return (b == 0) ? a : gcd(b, a % b);
	} return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b long a a long b b static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	} gcd {
		return (b == 0) ? a : gcd(b, a % b);
	} return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b int a a int b b static void out(String info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info String info info static void out(int info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info int info info static void out(double info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info double info info static void out(long info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info long info info public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static String I = "IMPOSSIBLE";
	public static String B = "Bad";
	public static String G = "Good";
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	}

	/*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static String n() {
		return sc.next();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}
} public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static String I = "IMPOSSIBLE";
	public static String B = "Bad";
	public static String G = "Good";
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	}

	/*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static String n() {
		return sc.next();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}
} Main
import java.util.Scanner;

public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static String I = "IMPOSSIBLE";
	public static String B = "Bad";
	public static String G = "Good";
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		int a = ni();
		int b = ni();

		if (a >= 13) {
			out(b);

		} else if (a <= 12 && a >= 6) {
			out(b / 2);
		} else {
			out(0);
		}

	}

	/*
	 * 以下メソッド集
	 */
	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static String n() {
		return sc.next();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}
}