/***************************************************
 * Problem Name : D.cpp
 * Problem Link :
 * OJ           :
 * Verdict      : Trying
 * Date         : 2020-04-19
 * Problem Type :
 * Author Name  : Saikat Sharma
 * University   : CSE, MBSTU
 ***************************************************/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitset>
#include <cassert>
#include <map>
#include <set>
#include <cassert>
#include <iomanip>
#include <random>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

#define __FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define __FileRead freopen ("input.txt", "r", stdin)
#define __FileWrite freopen ("output.txt", "w", stdout)
#define SET(a,v) memset(a,v,sizeof(a))
#define SZ(v) (int)v.size()
#define pii pair<int,int>
#define pil pair <int, ll>
#define pli pair <ll, int>
#define pll pair <ll, ll>
#define debug cout <<"######\n"
#define debug1(x) cout <<"### " << x << " ###\n"
#define debug2(x,y) cout <<"# " << x <<" : "<< y <<" #\n"
#define nl cout << "\n";
#define sp cout << " ";
#define sl(n) scanf("%lld", &n)
#define sf(n) scanf("%lf", &n)
#define si(n) scanf("%d", &n)
#define ss(n) scanf("%s", n)
#define pf(n) scanf("%d", n)
#define pfl(n) scanf("%lld", n)
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end()
#define srt(v) sort(v.begin(), v.end())
#define r_srt(v) sort(v.rbegin(), v.rend())
#define rev(v) reverse(v.rbegin(), v.rend())
#define Sqr(x) ((x)*(x))
#define Mod(x, m) ((((x) % (m)) + (m)) % (m))
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define pb push_back
#define mk make_pair
#define MAX 400005
#define INF 1000000009
#define MOD 1000000007

template<class T>
using min_heap = priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
using ordered_set  = tree<T, null_type, less<T>, rb_tree_tag,
      tree_order_statistics_node_update>;

template <typename T> string toString ( T Number ) {
    stringstream ss;
    ss << Number;
    return ss.str();
}
template<typename T> int toInt (T str) {
    stringstream ss;
    ss << str;
    int num;
    ss >> num;
    return num;
}
ll lcm ( ll a, ll b ) {
    return ( a / __gcd ( a, b ) ) * b;
}
/************************************ Code Start Here ******************************************************/
void fun (int n, int k) {
    vector<int>vec;

    for (int i = 10; i < 10 + n; i++) {
        vec.pb (i);
    }

    set<int>st;

    for (int mask = 1; mask < (1 << n); mask++) {
        int cnt = __builtin_popcount (mask);
        int sum = 0;
        //~ if(cnt == 2){
        int i = 0;
        int y = mask;

        while (y > 0) {
            int rem = y % 2;
            y /= 2;

            if (rem == 1) {
                sum += vec[i];
            }

            i++;
        }

        if (cnt >= k ) st.insert (sum);
    }

    cout << st.size() << "\n";
}

int main () {
    __FastIO;
    //~ cout << setprecision (10) << fixed;
    //~ fibo();
    //~ cout << ncr (4, 1) << "\n";
    ll n, k;
    cin >> n >> k;
    //~ fun (n + 1, k);
    ll res = 0;

    if (n % 2 == 0) {
        vector<ll>vec;
        vec.pb (1);
        ll sum = 1;
        ll ex = n;

        for (int i = 1; i <= n / 2; i++) {
            sum = sum + ex;
            vec.pb (sum);
            ex = ex - 2;
        }

        int sz = (int) vec.size() - 1;

        for (int i = sz; i >= 0; i--) {
            vec.pb (vec[i]);
        }

        for (int i = k; i < (int) vec.size(); i++) {
            res = (res + vec[i]) % MOD;
        }

    } else {
        vector<ll>vec;
        vec.pb (1);
        ll sum = 1;
        ll ex = n;

        for (int i = 1; i <= (n / 2) + 1; i++) {
            sum = sum + ex;
            vec.pb (sum);
            ex = ex - 2;
        }

        int sz = (int) vec.size() - 2;

        for (int i = sz; i >= 0; i--) {
            vec.pb (vec[i]);
        }

        for (int i = k; i < (int) vec.size(); i++) {
            res = (res + vec[i]) % MOD;
        }
    }

    cout << res << "\n";
    return 0;
}


Measured memory_bytes: 5324