#!/usr/bin/python3
from collections import deque

A, B = map(int, input().split())
k = int(input())

a1, b1, a2, b2 = 0, 0, 0, 0
akce1, akce2 = [], []
while (a1 != k and b1 != k and a2 != k and b2 != k):
    if a1 == A:
        a1 = 0
        akce1.append("a")
    elif b1 == 0:
        b1 = B
        akce1.append("B")
    else:
        prelito = min(A-a1, b1)
        a1 += prelito
        b1 -= prelito
        akce1.append("<")

    if b2 == B:
        b2 = 0
        akce2.append("b")
    elif a2 == 0:
        a2 = A
        akce2.append("A")
    else:
        prelito = min(a2, B-b2)
        a2 -= prelito
        b2 += prelito
        akce2.append(">")

if (a1 == k) or (b1 == k):
    akce = akce1
else:
    akce = akce2

print(len(akce))
print("\n".join(akce))