Problem: Let's assume that set S consists of m distinct intervals [l1, r1], [l2, r2], ..., [lm, rm] (1 ≤ li ≤ ri ≤ n; li, ri 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, [l1, r1] and [l2, r2], intersect if there is an integer x, which meets two inequalities: l1 ≤ x ≤ r1 and l2 ≤ x ≤ r2.

Sereja wonders, how many sets S are there, such that f(S) = k? Count this number modulo 1000000007 (109 + 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 (109 + 7).

Examples

Input

3 1


Output

23


Input

3 2


Output

32


Input

2 0


Output

1


Input

2 2


Output

2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int size = 550;
const int mdl = 1000 * 1000 * 1000 + 7;
long long ans[2][size][size];
int n, h;
long long sum[size][size];
long long pw[size];
int main() {
  cin >> n >> h;
  pw[0] = 1;
  for (int i = 1; i <= n + 1; i++) pw[i] = (pw[i - 1] + pw[i - 1]) % mdl;
  ans[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i; j++)
      for (int k = 0; k <= i; k++) {
        ans[i & 1][j][k] = ans[1 ^ (i & 1)][j][k];
        if (j > 0) ans[i & 1][j][k] = (ans[i & 1][j][k] * pw[k]) % mdl;
      }
    for (int j = 0; j <= i; j++) {
      sum[j][0] = ans[1 ^ (i & 1)][j][0];
      for (int k = 1; k <= i; k++) {
        sum[j][k] = (sum[j][k - 1] + ans[1 ^ (i & 1)][j][k]) % mdl;
      }
    }
    for (int j = 1; j <= i; j++)
      for (int k = 1; k <= i; k++) {
        ans[i & 1][j][i] =
            (ans[i & 1][j][i] + sum[j - 1][k - 1] * pw[k - 1]) % mdl;
      }
  }
  long long tans = 0;
  for (int i = 0; i <= n; i++) tans = (tans + ans[n & 1][h][i]) % mdl;
  cout << tans << endl;
  return 0;
}