1

#include <bits/stdc++.h>

using namespace std;

int n, k; const int N = 2e2 + 10; int a[N];

void dfs (int u, int sum, int p) { if (sum > n) return; if (u == k + 1) { if (sum == n) { cout << n << "="; for (int i = 1; i <= k - 1; i++) { cout << a[i] << "+"; } cout << a[n] << endl; } } for (int i = p; i <= n; i++) { a[u] = i; dfs (u + 1, sum + i, i); } }

int main() { // freopen ("A.in", "r", stdin); // freopen ("A.out", "w", stdout); cin >> n >> k; dfs (1, 0, 1); return 0; }