#include <cstdio>
using namespace std;int main() {int x, y;scanf("%d%d", &x, &y);int ans = x > y ? x : y;if (x > y) x--;else y--;if (x > y) ans += x;else ans += y;printf("%d", ans);return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;const int maxn = 25;
int a[maxn];int main() {int n;scanf("%d", &n);for (int i = 0; i < n; i++) scanf("%d", &a[i]);int ans = 0;for (int i = 0; i < n; i++) {bool flag = false;for (int j = i - 1; j >= 0; j--) {if (a[i] < a[j]) {flag = true;break;}}if (!flag) ans++;}printf("%d\n", ans);return 0;
}

#include <bits/stdc++.h>
using namespace std;const int maxn = 1e5 + 10;
char s[maxn];int main() {scanf("%s", s);int len = strlen(s);if (len == 1) {puts("0");return 0;}  int now = 0;int ans = 0;for (int i = 0; i < len; i++) {if (s[i] - '0' != now) ans++;now ^= 1;} int temp = 0;now = 1;for (int i = 0; i < len; i++) {if (s[i] - '0' != now) temp++;now ^= 1;}printf("%d\n", min(ans, temp));return 0;
}

#include <bits/stdc++.h>
using namespace std;const int maxn = 1e5 + 10;
char s[maxn];
struct Point {int l, r;
} G[maxn];int main() {int len, k;scanf("%d%d", &len, &k);scanf("%s", s);int l = 0;int cnt = 0;s[len] = '0';G[0].l = G[0].r = 0;cnt = 1;for (int i = 0; i <= len; i++) {if (s[i] == '1') {if (!l) G[cnt++].l = i;l++;  } else {if (l) G[cnt-1].r = i - 1;l = 0;}   }G[cnt].l = G[cnt].r = len - 1;cnt++;int ans = 0;if (k + 1 >= cnt) {printf("%d\n", len);return 0;}for (int i = 0; i < cnt; i++) {int temp = i + k;if (temp >= cnt) break;ans = max(ans, G[temp].r - G[i].l + 1);}ans = min(ans, len);printf("%d\n", ans);return 0;
}