#include <bits/stdc++.h>
using namespace std;
long long n, K, f[1500][1500][2][2], num[1500];
long long ans[1500], fac[1500], C[1500][1500];
long long read() {
  long long x = 0, k = 1;
  char c;
  c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') k = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * k;
}
void Up(long long &x, long long y) { x = (x + y) % 1000000007; }
void pre() {
  fac[0] = 1;
  for (long long i = 1; i < 1500; i++) fac[i] = fac[i - 1] * i % 1000000007;
  for (long long i = 0; i < 1500; i++) C[i][0] = 1;
  for (long long i = 1; i < 1500; i++)
    for (long long j = 1; j < 1500; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
}
signed main() {
  pre();
  n = read(), K = read();
  f[0][0][1][0] = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j <= i; j++)
      for (long long p = 0; p <= 1; p++)
        for (long long q = 0; q <= 1; q++) {
          Up(f[i + 1][j][q][0], f[i][j][p][q]);
          if (!p) Up(f[i + 1][j + 1][q][0], f[i][j][p][q]);
          if (i < n - 1) Up(f[i + 1][j + 1][q][1], f[i][j][p][q]);
        }
  }
  for (long long i = 0; i <= n; i++) {
    for (long long p = 0; p <= 1; p++)
      for (long long q = 0; q <= 1; q++) Up(num[i], f[n][i][p][q]);
    num[i] = num[i] * fac[n - i] % 1000000007;
  }
  ans[K] = num[K];
  for (long long i = K + 1, t = -1; i <= n; i++, t *= -1)
    Up(ans[K], (t * C[i][K] * num[i] % 1000000007) + 1000000007);
  printf("%lld\n", ans[K]);
  return 0;
}
