// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;

/// bigint {{{
#include <cassert>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <string>
#include <vector>
// forked https://gist.github.com/ar-pa/957297fb3f88996ead11
struct BigInteger {
private:
  typedef long long ll;
  typedef vector< ll > vll;
  static const int base = 1000000000;
  static const int base_digits = 9;

public:
  vector< int > a;
  int sign;
  BigInteger() : sign(1) {}
  BigInteger(ll v) { *this = v; }
  BigInteger(const string &s) { read(s); }

private:
  BigInteger(int, int sign) : sign(sign) {}

public:
  static const BigInteger infinity;

  int size() {
    if(a.empty()) return 0;
    int res = (a.size() - 1) * base_digits;
    int ca = a.back();
    while(ca) res++, ca /= 10;
    return res;
  }
  BigInteger operator^(const BigInteger &v) {
    BigInteger res = 1, a = *this, b = v;
    while(!b.isZero()) {
      if(b % 2) res *= a;
      a *= a;
      b /= 2;
    }
    return res;
  }
  string to_string() {
    stringstream ss;
    ss << *this;
    string s;
    ss >> s;
    return s;
  }
  int digitsum() {
    assert(sign == 1);
    string s = to_string();
    int ans = 0;
    for(auto c : s) ans += c - '0';
    return ans;
  }

  BigInteger &operator=(const BigInteger &v) {
    sign = v.sign;
    a = v.a;
    return *this;
  }

  BigInteger &operator=(ll v) {
    sign = 1;
    a.clear();
    if(v < 0) sign = -1, v = -v;
    for(; v > 0; v = v / base) a.push_back(v % base);
    return *this;
  }

  static BigInteger fromDouble(double v) {
    BigInteger res;
    res.sign = 1;
    res.a.clear();
    if(v < 0) res.sign = -1, v = -v;
    v = floor(v);
    while(v >= 1) {
      res.a.push_back((int) fmod(v, base));
      v = floor(v / base);
    }
    return res;
  }

  BigInteger operator+(const BigInteger &v) const {
    if(isInfinity()) return *this;
    if(v.isInfinity()) return v;
    if(sign == v.sign) {
      BigInteger res = v;

      for(int i = 0, carry = 0; i < (int) max(a.size(), v.a.size()) || carry; ++i) {
        if(i == (int) res.a.size()) res.a.push_back(0);
        res.a[i] += carry + (i < (int) a.size() ? a[i] : 0);
        carry = res.a[i] >= base;
        if(carry) res.a[i] -= base;
      }
      return res;
    }
    return *this - (-v);
  }

  BigInteger operator-(const BigInteger &v) const {
    if(sign == v.sign) {
      if(abs() >= v.abs()) {
        BigInteger res = *this;
        for(int i = 0, carry = 0; i < (int) v.a.size() || carry; ++i) {
          res.a[i] -= carry + (i < (int) v.a.size() ? v.a[i] : 0);
          carry = res.a[i] < 0;
          if(carry) res.a[i] += base;
        }
        res.trim();
        return res;
      }
      return -(v - *this);
    }
    return *this + (-v);
  }

  BigInteger &operator*=(int v) {
    if(v < 0) sign = -sign, v = -v;
    if(isInfinity()) return *this;
    for(int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
      if(i == (int) a.size()) a.push_back(0);
      ll cur = a[i] * (ll) v + carry;
      carry = (int) (cur / base);
      a[i] = (int) (cur % base);
      // asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
    }
    trim();
    return *this;
  }

  BigInteger operator*(int v) const {
    BigInteger res = *this;
    res *= v;
    return res;
  }

  BigInteger &operator*=(ll v) {
    if(v < 0) sign = -sign, v = -v;
    if(isInfinity()) return *this;
    for(int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
      if(i == (int) a.size()) a.push_back(0);
      ll cur = a[i] * (ll) v + carry;
      carry = (int) (cur / base);
      a[i] = (int) (cur % base);
      // asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
    }
    trim();
    return *this;
  }

  BigInteger operator*(ll v) const {
    BigInteger res = *this;
    res *= v;
    return res;
  }

  friend pair< BigInteger, BigInteger > divmod(const BigInteger &a1,
      const BigInteger &b1) {
    int norm = base / (b1.a.back() + 1);
    BigInteger a = a1.abs() * norm;
    BigInteger b = b1.abs() * norm;
    BigInteger q, r;
    q.a.resize(a.a.size());

    for(int i = a.a.size() - 1; i >= 0; i--) {
      r *= base;
      r += a.a[i];
      int s1 = r.a.size() <= b.a.size() ? 0 : r.a[b.a.size()];
      int s2 = r.a.size() <= b.a.size() - 1 ? 0 : r.a[b.a.size() - 1];
      int d = ((ll) base * s1 + s2) / b.a.back();
      r -= b * d;
      while(r < 0) r += b, --d;
      q.a[i] = d;
    }

    q.sign = a1.sign * b1.sign;
    r.sign = a1.sign;
    q.trim();
    r.trim();
    return make_pair(q, r / norm);
  }

  BigInteger operator/(const BigInteger &v) const {
    if(isInfinity()) {
      BigInteger res = *this;
      if(v.sign < 0) res.sign = -sign;
      return res;
    }
    if(v.isInfinity()) return BigInteger();
    if(v.isZero()) return infinity * sign;
    return divmod(*this, v).first;
  }

  BigInteger operator%(const BigInteger &v) const { return divmod(*this, v).second; }

  void operator/=(int v) {
    if(v < 0) sign = -sign, v = -v;
    if(isInfinity()) return;
    if(v == 0) *this = infinity * sign;
    for(int i = (int) a.size() - 1, rem = 0; i >= 0; --i) {
      ll cur = a[i] + rem * (ll) base;
      a[i] = (int) (cur / v);
      rem = (int) (cur % v);
    }
    trim();
  }

  BigInteger operator/(int v) const {
    BigInteger res = *this;
    res /= v;
    return res;
  }

  int operator%(int v) const {
    if(v < 0) v = -v;
    int m = 0;
    for(int i = a.size() - 1; i >= 0; --i) m = (a[i] + m * (ll) base) % v;
    return m * sign;
  }

  BigInteger &operator++() {
    *this = *this + 1;
    return *this;
  }
  BigInteger &operator--() {
    *this = *this - 1;
    return *this;
  }
  BigInteger operator++(int) {
    BigInteger tmp = *this;
    *this = *this + 1;
    return tmp;
  }
  BigInteger operator--(int) {
    BigInteger tmp = *this;
    *this = *this - 1;
    return tmp;
  }

  BigInteger &operator+=(const BigInteger &v) {
    *this = *this + v;
    return *this;
  }
  BigInteger &operator-=(const BigInteger &v) {
    *this = *this - v;
    return *this;
  }
  BigInteger &operator*=(const BigInteger &v) {
    *this = *this * v;
    return *this;
  }
  BigInteger &operator/=(const BigInteger &v) {
    *this = *this / v;
    return *this;
  }

  bool operator<(const BigInteger &v) const {
    if(sign != v.sign) return sign < v.sign;
    if(a.size() != v.a.size()) return a.size() * sign < v.a.size() * v.sign;
    for(int i = a.size() - 1; i >= 0; i--)
      if(a[i] != v.a[i]) return a[i] * sign < v.a[i] * sign;
    return false;
  }

  bool operator>(const BigInteger &v) const { return v < *this; }
  bool operator<=(const BigInteger &v) const { return !(v < *this); }
  bool operator>=(const BigInteger &v) const { return !(*this < v); }
  bool operator==(const BigInteger &v) const {
    if(sign != v.sign) return false;
    if(a.size() != v.a.size()) return false;
    for(size_t i = 0; i < a.size(); i++)
      if(a[i] != v.a[i]) return false;
    return true;
  }
  bool operator!=(const BigInteger &v) const { return !(*this == v); }

  void trim() {
    while(!a.empty() && !a.back()) a.pop_back();
    if(a.empty()) sign = 1;
  }

  inline bool isZero() const { return a.empty() || (a.size() == 1 && !a[0]); }

  inline bool isInfinity() const { return sign == 2 || sign == -2; }
  inline bool isPositiveInfinity() const { return sign == 2; }
  inline bool isNegativeInfinity() const { return sign == -2; }

  BigInteger operator-() const {
    BigInteger res = *this;
    res.sign = -sign;
    return res;
  }

  BigInteger operator+() const { return *this; }

  BigInteger abs() const {
    BigInteger res = *this;
    if(res.sign < 0) res.sign = -res.sign;
    return res;
  }

  ll toLong() const {
    ll res = 0;
    for(int i = a.size() - 1; i >= 0; i--) res = res * base + a[i];
    return res * sign;
  }

  friend BigInteger gcd(const BigInteger &a, const BigInteger &b) {
    return b.isZero() ? a : gcd(b, a % b);
  }
  friend BigInteger lcm(const BigInteger &a, const BigInteger &b) {
    return a / gcd(a, b) * b;
  }

  void read(const string &s) {
    sign = 1;
    a.clear();
    int pos = 0;
    while(pos < (int) s.size() && (s[pos] == '-' || s[pos] == '+')) {
      if(s[pos] == '-') sign = -sign;
      ++pos;
    }
    for(int i = s.size() - 1; i >= pos; i -= base_digits) {
      int x = 0;
      for(int j = max(pos, i - base_digits + 1); j <= i; j++) x = x * 10 + s[j] - '0';
      a.push_back(x);
    }
    trim();
  }

  friend istream &operator>>(istream &stream, BigInteger &v) {
    string s;
    stream >> s;
    v.read(s);
    return stream;
  }

  friend ostream &operator<<(ostream &stream, const BigInteger &v) {
    if(v.isPositiveInfinity()) {
      stream << "inf";
    } else if(v.isNegativeInfinity()) {
      stream << "-inf";
    } else {
      if(v.sign == -1) stream << '-';
      stream << (v.a.empty() ? 0 : v.a.back());
      for(int i = (int) v.a.size() - 2; i >= 0; --i)
        stream << setw(base_digits) << setfill('0') << v.a[i];
    }
    return stream;
  }

  static vector< int > convert_base(const vector< int > &a, int old_digits,
      int new_digits) {
    vector< ll > p(max(old_digits, new_digits) + 1);
    p[0] = 1;
    for(int i = 1; i < (int) p.size(); i++) p[i] = p[i - 1] * 10;
    vector< int > res;
    ll cur = 0;
    int cur_digits = 0;
    for(int i = 0; i < (int) a.size(); i++) {
      cur += a[i] * p[cur_digits];
      cur_digits += old_digits;
      while(cur_digits >= new_digits) {
        res.push_back(int(cur % p[new_digits]));
        cur /= p[new_digits];
        cur_digits -= new_digits;
      }
    }
    res.push_back((int) cur);
    while(!res.empty() && !res.back()) res.pop_back();
    return res;
  }

  static vll karatsubaMultiply(const vll &a, const vll &b) {
    int n = a.size();
    vll res(n + n);
    if(n <= 32) {
      for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++) res[i + j] += a[i] * b[j];
      return res;
    }

    int k = n >> 1;
    vll a1(a.begin(), a.begin() + k);
    vll a2(a.begin() + k, a.end());
    vll b1(b.begin(), b.begin() + k);
    vll b2(b.begin() + k, b.end());

    vll a1b1 = karatsubaMultiply(a1, b1);
    vll a2b2 = karatsubaMultiply(a2, b2);

    for(int i = 0; i < k; i++) a2[i] += a1[i];
    for(int i = 0; i < k; i++) b2[i] += b1[i];

    vll r = karatsubaMultiply(a2, b2);
    for(int i = 0; i < (int) a1b1.size(); i++) r[i] -= a1b1[i];
    for(int i = 0; i < (int) a2b2.size(); i++) r[i] -= a2b2[i];

    for(int i = 0; i < (int) r.size(); i++) res[i + k] += r[i];
    for(int i = 0; i < (int) a1b1.size(); i++) res[i] += a1b1[i];
    for(int i = 0; i < (int) a2b2.size(); i++) res[i + n] += a2b2[i];
    return res;
  }

  BigInteger operator*(const BigInteger &v) const {
    if(isInfinity() || v.isInfinity()) return infinity * sign * v.sign;
    vector< int > a6 = convert_base(this->a, base_digits, 6);
    vector< int > b6 = convert_base(v.a, base_digits, 6);
    vll a(a6.begin(), a6.end());
    vll b(b6.begin(), b6.end());
    while(a.size() < b.size()) a.push_back(0);
    while(b.size() < a.size()) b.push_back(0);
    while(a.size() & (a.size() - 1)) a.push_back(0), b.push_back(0);
    vll c = karatsubaMultiply(a, b);
    BigInteger res;
    res.sign = sign * v.sign;
    for(int i = 0, carry = 0; i < (int) c.size(); i++) {
      ll cur = c[i] + carry;
      res.a.push_back((int) (cur % 1000000));
      carry = (int) (cur / 1000000);
    }
    res.a = convert_base(res.a, 6, base_digits);
    res.trim();
    return res;
  }
};

const BigInteger BigInteger::infinity(0, 2);

#include <limits>

namespace std {
  template <>
    class numeric_limits< BigInteger > {
    public:
      static constexpr bool has_infinity = true;
      static constexpr bool is_signed = true;
      static constexpr bool is_integer = true;
      static constexpr bool is_bounded = false;
      static BigInteger infinity() { return BigInteger::infinity; }
      static BigInteger max() { return BigInteger(); }
      static BigInteger min() { return BigInteger(); }
      static BigInteger round_error() { return BigInteger(); }
    };
} // namespace std

using bigint = BigInteger;

/// }}}


int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  int n, k;
  cin >> n >> k;

  cout << n - k + 1 << endl;

  return 0;
}


Measured memory_bytes: 256