Problem:
Enumeration

n個の整数a1, a2, …, anとn個の整数p1, p2, …, pn、整数mが与えられる。k番目の整数akをpk[%]の確率で選ぶ、という操作を各k(1 ≤ k ≤ n)について行い、0個以上n個以下の整数を選び出す。1以上m以下の整数の中で、選ばれた整数の少なくとも1つで割り切れるものの個数の期待値を求めよ。

Input

入力は以下の形式で与えられる。

n m
a1 a2 … an
p1 p2 … pn

Constraints

1 ≤ n ≤ 20

1 ≤ m ≤ 1018

1 ≤ ak ≤ 1018 (1 ≤ k ≤ n)

1 ≤ pk ≤ 99 (1 ≤ k ≤ n)

Output

問題の解を1行に出力せよ。出力には絶対誤差あるいは相対誤差で0.0000001(= 10-7)を超える誤差があってはならない。

Sample Input 1

2 15
3 5
50 50

Output for the Sample Input 1

3.75

確率

選ばれた数字

割り切る数

個数

25%

[]

 

0個

25%

[3]

3 6 9 12 15

5個

25%

[5]

5 10 15

3個

25%

[3,5]

3 5 6 9 10 12 15

7個

よって0.25 × (0 + 5 + 3 + 7) = 3.75

Sample Input 2

4 100
2 3 5 7
80 60 40 20

Output for the Sample Input 2

57.352

Sample Input 3

4 210
2 3 5 7
80 60 40 20

Output for the Sample Input 3

119.9136

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static boolean debug = true;

	static void solve() {
		int n = ir.nextInt();
		long m = ir.nextLong();
		long[] a = ir.nextLongArray(n);
		int[] p = ir.nextIntArray(n);
		long[] lcm = new long[1 << n];
		double[] pro = new double[1 << n];
		pro[0] = 1.0;
		for (int i = 0; i < n; i++)
			pro[0] *= 1.0 - p[i] / 100.0;
		lcm[0] = 1;
		for (int i = 1; i < 1 << n; i++) {
			int x = Integer.highestOneBit(i);
			int y = Integer.numberOfTrailingZeros(x);
			lcm[i] = a[y] * lcm[i ^ x] / gcd(a[y], lcm[i ^ x]);
			pro[i] = pro[i ^ x] * (double) p[y] / (100 - p[y]);
		}
		long[][] dp = new long[2][1 << n];
		for (int i = 0; i < 1 << n; i++)
			dp[n & 1][i] = m / lcm[i];
		for (int i = n - 1; i >= 0; i--) {
			for (int j = 0; j < 1 << n; j++) {
				dp[i & 1][j] = dp[i & 1 ^ 1][j];
				if ((j & 1 << i) == 0)
					dp[i & 1][j] -= dp[i & 1 ^ 1][j | 1 << i];
			}
			Arrays.fill(dp[i & 1 ^ 1], 0);
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 1 << n; j++) {
				dp[i & 1 ^ 1][j] = dp[i & 1][j];
				if ((j & 1 << i) != 0)
					dp[i & 1 ^ 1][j] += dp[i & 1][j ^ 1 << i];
			}
			Arrays.fill(dp[i & 1], 0);
		}
		double ret = 0.0;
		for (int i = 0; i < 1 << n; i++) {
			ret += (m - dp[n & 1][((1 << n) - 1) ^ i]) * pro[i];
		}
		out.println(ret);
	}

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

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

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

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

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

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		if (debug)
			out.println(Arrays.deepToString(o));
	}
}