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 long long MOD = 1e9 + 7;
const int INF = 2e9;
const long long INF64 = 1e18;
const long double EPS = 1e-16;
const long double PI = acos(-1);
const long long MD = 1551513443;
const long long T = 25923;
const int N = 501;
const int M = 25;
const int DEBUG = 0;
const int MAGIC = 320;
int n, k;
long long dp1[N][N], dp[N][N], pw[N];
int main() {
  pw[0] = 1;
  for (int i = 1; i < N; i++) pw[i] = (pw[i - 1] * 2LL) % MOD;
  cin >> n >> k;
  dp1[1][1] = dp1[0][0] = 1;
  for (int i = 2; i <= n; i++) {
    for (int count = 0; count <= min(k, i); count++)
      for (int j = i - 1; j >= 0; j--) {
        dp[count][j] += dp1[count][j] * pw[j];
        dp[count][j] %= MOD;
        if (count < k) {
          dp[count + 1][i] += dp1[count][j] * (pw[i - j] - 1LL) % MOD * pw[j];
          dp[count + 1][i] %= MOD;
        }
      }
    for (int ii = 0; ii <= min(k, i); ii++)
      for (int jj = 0; jj <= i; jj++) {
        dp1[ii][jj] = dp[ii][jj];
        dp[ii][jj] = 0;
      }
  }
  long long ans = 0;
  for (int i = 0; i <= n; i++) ans = (ans + dp1[k][i]) % MOD;
  cout << ans << endl;
  return 0;
}