# Solution of;
# Project Euler Problem 734: A bit of prime
# https://projecteuler.net/problem=734
# 
# The logical-OR of two bits is 0 if both bits are 0, otherwise it is 1. The 
# bitwise-OR of two positive integers performs a logical OR operation on each 
# pair of corresponding bits in the binary expansion of its inputs. For 
# example, the bitwise-OR of $10$ and $6$ is $14$ because $10 = 1010_2$, $6 = 
# 0110_2$ and $14 = 1110_2$. Let $T(n, k)$ be the number of $k$-tuples $(x_1, 
# x_2,\cdots,x_k)$ such thatevery $x_i$ is a prime $\leq n$the bitwise-OR of 
# the tuple is a prime $\leq n$For example, $T(5, 2)=5$. The five 2-tuples are 
# (2, 2), (2, 3), (3, 2), (3, 3) and (5, 5). You are given $T(100, 3) = 3355$ 
# and $T(1000, 10) \equiv 2071632 \pmod{1\,000\,000\,007}$Find 
# $T(10^6,999983)$. Give your answer modulo $1\,000\,000\,007$
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 734
    timed.caller(dummy, n, i, prob_id)
