Sereja and Sets

1000ms

262144K

Description:

Let's assume that set S consists of m distinct intervals [l₁, r₁], [l₂, r₂], ..., [l_m, r_m] (1 ≤ l_i ≤ r_i ≤ n; l_i, r_i are integers).

Let's assume that f(S) is the maximum number of intervals that you can choose from the set S, such that every two of them do not intersect. We assume that two intervals, [l₁, r₁] and [l₂, r₂], intersect if there is an integer x, which meets two inequalities: l₁ ≤ x ≤ r₁ and l₂ ≤ x ≤ r₂.

Sereja wonders, how many sets S are there, such that f(S) = k? Count this number modulo 1000000007 (10⁹ + 7).

Input:

The first line contains integers n, k (1 ≤ n ≤ 500; 0 ≤ k ≤ 500).

Output:

In a single line, print the answer to the problem modulo 1000000007 (10⁹ + 7).

Sample Input:

3 1

Sample Output:

Sample Input:

3 2

Sample Output:

Sample Input:

2 0

Sample Output:

Sample Input:

2 2

Sample Output:

Informação

Provedor Codeforces

Código CF425E