Dima loves making pictures on a piece of squared paper. And yet more than that Dima loves the pictures that depict one of his favorite figures. 

A piece of squared paper of size n × m is represented by a table, consisting of n rows and m columns. All squares are white on blank squared paper. Dima defines a picture as an image on a blank piece of paper, obtained by painting some squares black.

The picture portrays one of Dima's favorite figures, if the following conditions hold:

  * The picture contains at least one painted cell; 
  * All painted cells form a connected set, that is, you can get from any painted cell to any other one (you can move from one cell to a side-adjacent one); 
  * The minimum number of moves needed to go from the painted cell at coordinates (x1, y1) to the painted cell at coordinates (x2, y2), moving only through the colored cells, equals |x1 - x2| + |y1 - y2|. 



Now Dima is wondering: how many paintings are on an n × m piece of paper, that depict one of his favorite figures? Count this number modulo 1000000007 (109 + 7).

Input

The first line contains two integers n and m — the sizes of the piece of paper (1 ≤ n, m ≤ 150).

Output

In a single line print the remainder after dividing the answer to the problem by number 1000000007 (109 + 7).

Examples

Input

2 2


Output

13


Input

3 4


Output

571
import java.math.*;
import java.io.*;
import java.util.*;

public class Main
{
    final static int MOD=1000000007;
    static int dp[][][],cs[][][],mas[][],nx[][],pr[][],n,m,now,last,ans;
    static int sum(int ci,int cj,int t1,int t2)
    {
        if (ci<0 || cj<0) return 0; else
        return cs[ci][cj][t1*3+t2];
    }
    static int sum(int i1,int i2,int j1,int j2,int t1,int t2)
    {
        int ans=sum(i2,j2,t1,t2);
        ans-=sum(i1-1,j2,t1,t2); if (ans<0) ans+=MOD;
        ans-=sum(i2,j1-1,t1,t2); if (ans<0) ans+=MOD;
        ans+=sum(i1-1,j1-1,t1,t2); if (ans>=MOD) ans-=MOD;
        return ans;
    }
    public static int count()
    {
        Scanner in = new Scanner(new InputStreamReader(System.in));
        n = in.nextInt(); m = in.nextInt();
        mas=new int[n][m];
        for (int i=0;i<n;++i)
        {
            for (int j=0;j<m;++j)
            {
                mas[i][j] = 0;
            }
        }
        nx=new int[n][m];
        pr=new int[n][m];
        cs=new int[m][m][9];
        dp=new int[m][m][4];
        for (int j=0;j<m;++j) for (int z=0;z<m;++z) for (int t1=0;t1<4;++t1) dp[j][z][t1]=0;
        
        for (int i=0;i<n;++i)
        {
            for (int j=0;j<m;++j)
            {
                if (mas[i][j]!=0) pr[i][j]=j; else
                if (j==0) pr[i][j]=-1; else
                pr[i][j]=pr[i][j-1];
            }
            for (int j=m-1;j>=0;--j)
            {
                if (mas[i][j]!=0) nx[i][j]=j; else
                if(j==m-1) nx[i][j]=m; else
                nx[i][j]=nx[i][j+1];
            }
        }
        
        ans=0;
        
        for (int i=0;i<n;++i)
        {
            for (int j1=0;j1<m;++j1)
            {
                for (int j2=0;j2<m;++j2)
                {
                    for (int t1=0;t1<2;++t1)
                    {
                        for (int t2=0;t2<2;++t2)
                        {
                            long t=dp[j1][j2][t1*2+t2];
                            if (j1==0 && j2==0); else
                            if (j2==0) t+=cs[j1-1][j2][t1*3+t2]; else
                            if (j1==0) t+=cs[j1][j2-1][t1*3+t2]; else
                            {
                                t+=cs[j1-1][j2][t1*3+t2];
                                t+=cs[j1][j2-1][t1*3+t2];
                                t-=cs[j1-1][j2-1][t1*3+t2];
                            }
                            while (t>=MOD) t-=MOD;
                            while (t<0) t+=MOD;
                            cs[j1][j2][t1*3+t2]=(int)t;
                            dp[j1][j2][t1*2+t2]=0;
                        }
                    }
                }
            }
            for (int j1=0;j1<m;++j1) for (int j2=0;j2<m;++j2) for (int t1=0;t1<3;++t1) for (int t2=0;t2<3;++t2)
            {
                if (t1<2 && t2<2) continue;
                int cur=0;
                for (int z1=0;z1<2;++z1) for (int z2=0;z2<2;++z2)
                {
                    if (z1!=t1 && t1!=2) continue;
                    if (z2!=t2 && t2!=2) continue;
                    cur+=cs[j1][j2][z1*3+z2]; if (cur>=MOD) cur-=MOD;
                }
                cs[j1][j2][t1*3+t2]=cur;
            }
            for (int j1=0;j1<m;++j1)
            {
                for (int j2=j1;j2<m;++j2)
                {
                    if (mas[i][j2]!=0) break;
                    for (int left=0;left<2;++left)
                    {
                        for (int right=0;right<2;++right)
                        {
                            int cur=dp[j1][j2][left*2+right];
                            if (left==0 && right==0) cur=1;
                            if (i==0)
                            {
                                dp[j1][j2][left*2+right]=cur;
                                ans+=cur; if (ans>=MOD) ans-=MOD;
                                continue;
                            }
                            // 0 - inc, 1 - dec, 2 - stay
                            for (int t1=0;t1<3;++t1)
                            {
                                if (t1<2 && left!=t1) continue; 
                                int l1,l2,z1;
                                if (t1==0)
                                {
                                    l1=j1+1;
                                    l2=j2;
                                    z1=0;
                                } else
                                if (t1==1)
                                {
                                    l1=pr[i-1][j1]+1;
                                    l2=j1-1;
                                    z1=2;
                                } else
                                {
                                    l1=l2=j1;
                                    z1=left;
                                }
                                for (int t2=0;t2<3;++t2)
                                {
                                    if (t2<2 && right!=t2) continue;
                                    int r1,r2,z2;
                                    if (t2==0)
                                    {
                                        r2=j2-1;
                                        r1=j1;
                                        z2=0;
                                    } else
                                    if (t2==1)
                                    {
                                        r2=nx[i-1][j2]-1;
                                        r1=j2+1;
                                        z2=2;
                                    } else
                                    {
                                        r1=r2=j2;
                                        z2=right;
                                    }
                                    cur+=sum(l1,l2,r1,r2,z1,z2); if (cur>=MOD) cur-=MOD;
                                }
                            }
                            dp[j1][j2][left*2+right]=cur;
                            ans+=cur; if (ans>=MOD) ans-=MOD;
                        }
                    }
                }
            }
        }
        return ans;
    }
    public static void main(String[] args) throws IOException
    {
        System.out.println(count());
    }
}