#include <stdio.h>

char ucty[10000][11];
float stav[10000];
int index[10000], pu;
float total,j;

char cu[11],cu2[11],command[64];

int i,k;

int hashni(char *cu)
{
    unsigned int i,j;
    j = 1;
    for (i=0;i<10;i++)
    {
	j *= *(cu+i)+1;
	j += *(cu+i);
    }
/*
    printf("Hashol som %s na %d.\n",cu,j % 10000);
*/    
    return j % 10000;
}

int find(char *cu)
{
    int i,j;
    
    i = hashni(cu);

    for (j=i;j<10000;j++)
    {
	if (ucty[j][0] == 0)
	    return -j-1;
	else
	    if (strcmp(cu,ucty[j]) == 0)
		return j;
    }
    for (j=1;j<i;j++)
    {
	if (ucty[j][0] == -1)
	    return -(j+1);
	else
	    if (strcmp(cu,ucty[j]) == 0)
		return j;
    }
    printf("HASH ERROR!\n");
    return 0;
}

int main()
{

    pu = 0;
    total = 0;
    for (i=0;i<10000;i++)
    {
        stav[i] = 0;
        ucty[i][0] = 0;
    }

    while (gets(command) != NULL)
    {
	switch (command[0])
	{
	    case 'Z':
		sscanf(command+6,"%s",cu);
		i = find(cu);
		if (i < 0)
		{
		    i = -i-1;
		    index[pu++] = i;
		    strcpy(ucty[i],cu);
		    stav[i] = 0;
		    printf("Ucet %s vytvoren.\n",cu);
		}
		else
		{
		    printf("Ucet %s uz existuje.\n",cu);
		}
		break;
	    case 'U':
		sscanf(command+5,"%s %f",cu,&j);
		i = find(cu);
		if (i < 0)
		{
		    printf("Ucet %s neexistuje.\n",cu);
		}
		else
		{
		    stav[i] += j;
		    total += j;
		    printf("Ulozeno %.2f na ucet %s.\n",j,cu);
		}
		break;
	    case 'V':
		sscanf(command+6,"%s %f",cu,&j);
		i = find(cu);
		if (i < 0)
		{
		    printf("Ucet %s neexistuje.\n",cu);
		}
		else
		{
		    if (stav[i] >= j)
		    {
			stav[i] -= j;
			total -= j;
			printf("Vybrano %.2f z uctu %s.\n",j,cu);
		    }
		    else {
			printf("Nedostatek penez.\n");
		    }
		}
		break;
	    case 'P':
		sscanf(command+7,"%s %s %f",cu,cu2,&j);
		
		i = find(cu);
		if (i < 0)
		{
		    printf("Ucet %s neexistuje.\n",cu);
		}
		else
		{
		    if (stav[i] >= j)
		    {
			k = find(cu2);
			if (k < 0)
			{
			    printf("Ucet %s neexistuje.\n",cu2);
			}
			else
			{
			    stav[i] -= j;
			    stav[k] += j;
			    printf("Prevedeno %.2f z uctu %s na ucet %s.\n",j,cu,cu2);
			}
		    }
		    else {
			printf("Nedostatek penez.\n");
		    }
		}
		break;
	    case 'S':
		printf("Pocet uctu: %d\n",pu);
		printf("Celkem:     %10.2f\n",total);
		break;
	    case 'L':
		printf("Pocet uctu: %d\n",pu);
		for (i=0;i<pu;i++)
		{
		    printf("%s %10.2f\n",ucty[index[i]],stav[index[i]]);
		}
		printf("Celkem:     %10.2f\n",total);
		break;
	    case 'R':
		printf("Reset systemu.\n");
		pu = 0;
		total = 0;		
		for (i=0;i<10000;i++)
		{
		    stav[i] = 0;
		    ucty[i][0] = 0;
		}
	}
	printf("\n");
    }
    printf("Konec.\n");
    
    return 0;
}